Relative neighborhood graphs in three dimensions

This publication has 20 references indexed in Scilit:

• Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs
  Algorithmica, 1992
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
  Computational Geometry, 1992
• Euclidean minimum spanning trees and bichromatic closest pairs
  Discrete & Computational Geometry, 1991
• A deterministic view of random sampling and its use in geometry
  Combinatorica, 1990
• Combinatorial complexity bounds for arrangements of curves and spheres
  Discrete & Computational Geometry, 1990
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
  Published by Association for Computing Machinery (ACM) ,1990
• Applications of random sampling in computational geometry, II
  Discrete & Computational Geometry, 1989
• A Randomized Algorithm for Closest-Point Queries
  SIAM Journal on Computing, 1988
• New applications of random sampling in computational geometry
  Discrete & Computational Geometry, 1987
• The relative neighborhood graph for mixed feature variables
  Pattern Recognition, 1985