Keywords
Voronoi diagramDelaunay triangulationNeighbourhood (mathematics)CombinatoricsMathematicsSpanning treePlanar graphGraphPlanarComputational geometryAlgorithmComputer scienceDiscrete mathematicsGeometry
Affiliated Institutions
Related Publications
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
The Delaunay tessellation in n-dimensional space is a space-filling aggregate of n-simplices. These n-simplices are the dual forms of the vertices in the commonly used Voronoi t...
A computational geometric approach to feasible region division in constrained global optimization
Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practica...
Approximating Complex Surfaces by Triangulation of Contour Lines
An algorithm is described for obtaining an optimal approximation, using triangulation, of a three-dimensional surface defined by randomly distributed points along contour lines....
Publication Info
- Year
- 1980
- Type
- article
- Volume
- 12
- Issue
- 4
- Pages
- 261-268
- Citations
- 988
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
988
OpenAlex
Cite This
Godfried T. Toussaint
(1980).
The relative neighbourhood graph of a finite planar set.
Pattern Recognition
, 12
(4)
, 261-268.
https://doi.org/10.1016/0031-3203(80)90066-7
Identifiers
- DOI
- 10.1016/0031-3203(80)90066-7