Nearest Neighbour Graph and Locally Minimal Triangulation

Nearest neighbour graph (NNG) is a useful tool namely for collision detection tests. It is well known that NNG, when considered as an undirected graph, is a subgraph of Delaunay triangulation (DT) and this relation can be used for efficient NNG computation. This paper concentrates on relation of NNG to the locally minimal triangulation (LMT) and shows that, although NNG can be proved not to be a LMT subgraph, in most cases LMT contains all or nearly all NNG edges. This fact can also be used for NNG computation, namely in kinetic problems, because LMT computation is easier.

[1]  Tamal K. Dey,et al.  Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[2]  Jack Snoeyink,et al.  Implementations of the LMT heuristic for minimum weight triangulation , 1998, SCG '98.

[3]  Leonidas J. Guibas,et al.  An empirical comparison of techniques for updating Delaunay triangulations , 2004, SCG '04.

[4]  Prosenjit Bose,et al.  Diamonds are Not a Minimum Weight Triangulation's Best Friend , 1996, Int. J. Comput. Geom. Appl..

[5]  Matthew Dickerson,et al.  A Large Subgraph of the Minimum Weight Triangulation , 1997, Discret. Comput. Geom..

[6]  Robert L. Scot Drysdale,et al.  A comparison of sequential Delaunay triangulation algorithms , 1995, SCG '95.

[7]  Marina L. Gavrilova,et al.  Swap conditions for dynamic Voronoi diagrams for circles and line segments , 1999, Comput. Aided Geom. Des..

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  Marina L. Gavrilova,et al.  Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space , 2003, Comput. Aided Geom. Des..

[10]  Matthew Dickerson,et al.  A (usually?) connected subgraph of the minimum weight triangulation , 1996, SCG '96.

[11]  Han-Gue Cho.  On the expected number of common edges in delaunay and greedy triangulation , 1997 .

[12]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[13]  Hwan-Gue Cho,et al.  An improved TIN compression using Delaunay triangulation , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[14]  Franz Aurenhammer,et al.  Triangulations intersect nicely , 1995, SCG '95.

[15]  Franziska Hoffmann,et al.  Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .