The relative neighbourhood graph of a finite planar set

Pattern Recognition

Volumn 12, Issue 4, 1980, Pages 261-268

  Toussaint, Godfried T ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Algorithms; Computational perception; Delaunay triangulation; Dot patterns; Geometric complexity Geometric probability; Minimal spanning tree; Pattern recognition; Relative neighbourhood graph; Triangulations

Indexed keywords

PATTERN RECOGNITION SYSTEMS;

EID: 0019213414     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(80)90066-7     Document Type: Article

References (18)

1. Graph-theoretical methods for detecting and describing gestalt clusters
2. A computational view of perception
3. Triangulation of planar regions with applications
4. Locally equiangular triangulations
5. Computing Dirichlet tessellations in the plane
6. Analytic delineation of Thiessen polygons
7. Closest point problems
8. Regionalization theory and alternative algorithms
9. Divide and conquer for linear expected time
10. Efficient convex hull algorithms for points in two and more dimensions
11. Random minimal trees
12. Random minimal trees
13. An alternative definition for neighbourhood of a point
14. Shared near neighbour maximal spanning trees for cluster analysis
15. Statistical methods in algorithm design and analysis