IEEE - Institute of Electrical and Electronics Engineers, Inc. - An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions

Proceedings Fourth International Conference on High-Performance Computing

Author(s): Graf, T. ; Kamakoti, V. ; Janaki Latha, N.S. ; Pandu Rangan, C.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1997
Conference Location: Bangalore, India, India
Conference Date: 18 December 1997
Page(s): 132 - 136
ISBN (Paper): 0-8186-8067-9
DOI: 10.1109/HIPC.1997.634483
Regular:

Given a set S of n points in R/sup D/, D/spl ges/2. Each point p/spl isin/S is assigned a color c(p) chosen from a fixed color set. The All-Nearest-Foreign-Neighbors Problem (ANFNP) is to... View More

Advertisement