Nearest Neighbour Graph and Locally Minimal Triangulation

  • Ivana KolingerováEmail author
  • Andrej Ferko
  • Tomáš Vomáčka
  • Martin Maňák
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10405)


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.


Nearest Neighbour Graph Locally Minimal Triangulation Delaunay triangulation Kinetic problem 



This work was supported by the Ministry of Education, Youth and Sports of the Czech Republic, the project SGS-2016-013 Advanced Graphical and Computing Systems and the project PUNTIS (LO1506) under the program NPU I. We would like to thank to T. Bayer from the Charles University in Prague, Czech Republic for supplying us the real terrain data for the experiments.


  1. 1.
    Aichholzer, O., Aurenhammer, F., Cheng, S.W., Katoh, N., Rote, G., Taschwer, M., Xu, Y.F.: Triangulations intersect nicely. Discrete Comput. Geom. 16(4), 339–359 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31(1), 1–28 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bayer, T.: Department of Applied Geoinformatics and Cartography, Faculty of Science, Charles University, Prague, Czech Republic. Accessed 15 May 2017
  4. 4.
    Beirouti, R., Snoeyink, J.: Implementations of the LMT heuristic for minimum weight triangulation. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SCG 1998, pp. 96–105. ACM, New York (1998)Google Scholar
  5. 5.
    Bose, P., Devroye, L., Evans, W.: Diamonds are not a minimum weight triangulation’s best friend. Int. J. Comput. Geom. Appl. 12(06), 445–453 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cho, H.G.: On the expected number of common edges in Delaunay and greedy triangulation. J. WSCG 5(1–3), 50–59 (1997)Google Scholar
  7. 7.
    Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics). Cambridge University Press, New York (2006)CrossRefGoogle Scholar
  8. 8.
    Dickerson, M.T., Keil, J.M., Montague, M.H.: A large subgraph of the minimum weight triangulation. Discrete Comput. Geom. 18(3), 289–304 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Dickerson, M.T., Montague, M.H.: A (usually?) connected subgraph of the minimum weight triangulation. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, SCG 1996, pp. 204–213. ACM, New York (1996)Google Scholar
  10. 10.
    Gavrilova, M., Rokne, J.: Swap conditions for dynamic Voronoi diagrams for circles and line segments. Comput. Aided Geom. Des. 16(2), 89–106 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gavrilova, M., Rokne, J.: Updating the topology of the dynamic Voronoi diagram for spheres in euclidean d-dimensional space. Comput. Aided Geom. Des. 20(4), 231–242 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Guibas, L., Russel, D.: An empirical comparison of techniques for updating Delaunay triangulations. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004, pp. 170–179. ACM, New York (2004)Google Scholar
  13. 13.
    Kim, Y.S., Park, D.G., Jung, H.Y., Cho, H.G., Dong, J.J., Ku, K.J.: An improved TIN compression using Delaunay triangulation. In: Proceedings of Seventh Pacific Conference on Computer Graphics and Applications (Cat. No. PR00293), pp. 118–125 (1999)Google Scholar
  14. 14.
    Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Probability and Statistics, 2nd edn. Wiley, New York (2000)CrossRefzbMATHGoogle Scholar
  15. 15.
    Preparata, F.P., Shamos, M.: Computational Geometry: An Introduction. Springer, New York (1985)CrossRefzbMATHGoogle Scholar
  16. 16.
    Su, P., Drysdale, R.L.S.: A comparison of sequential Delaunay triangulation algorithms. Comput. Geom. 7(5), 361–385 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Špelič, D., Novak, F., Žalik, B.: Delaunay triangulation benchmarks. J. Electr. Eng. 59(1), 49–52 (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Ivana Kolingerová
    • 1
    • 3
    Email author
  • Andrej Ferko
    • 2
  • Tomáš Vomáčka
    • 1
  • Martin Maňák
    • 3
  1. 1.Department of Computer Science, Faculty of Applied SciencesUniversity of West BohemiaPilsenCzech Republic
  2. 2.Department of Algebra, Geometry and Didactics of Mathematics, Faculty of Mathematics, Physics and InformaticsComenius UniversityBratislavaSlovakia
  3. 3.New Technologies for the Information Society, Faculty of Applied SciencesUniversity of West BohemiaPilsenCzech Republic

Personalised recommendations