ISBN:  Unavailable

Category: Unavailable

Page count: 15

Abstract: "Given n points in the Euclidean plane, suppose we partition the plane around each point into k angular regions where k is some constant. For each region, define the angle restricted nearest neighbor of the i-th point to be a point in the given set that lies in this region and that is the closest to the i-th point in L[subscript p] metric. Two points, i and j, are said to be symmetric angle restricted nearest neighbors (SARNN) of each other if the i-th point is the nearest neighbor in one of the k regions of the j-th point and, conversely, if the j-th point is the nearest neighbor in one of the k regions of the i-th point. The SARRN problem requires the computation of all symmetric angle restricted nearest neighbors in the given set.