Neighbourhood Graphs and Locally Minimal Triangulations
- 183 Downloads
Neighbourhood (or proximity) graphs, such as nearest neighbour graph, closest pairs, relative neighbourhood graph and k-nearest neighbour graph are useful tools in many tasks inspecting mutual relations, similarity and closeness of objects. Some of neighbourhood graphs are subsets of Delaunay triangulation (DT) and this relation can be used for efficient computation of these graphs. This paper concentrates on relation of neighbourhood graphs to the locally minimal triangulation (LMT) and shows that, although generally these graphs are not LMT subgraphs, in most cases LMT contains all or many edges of these graphs. This fact can also be used for the neighbourhood graphs computation, namely in kinetic problems, because LMT computation is easier.
KeywordsNearest neighbour graph K-nearest neighbour graph Locally minimal triangulation Delaunay triangulation Kinetic problem
This work was supported by the Czech Science Foundation, the project number 17-07690S, and by the Ministry of Education, Youth and Sports of the Czech Republic, project number LO1506 (PUNTIS). 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.
- 3.Bayer, T.: Department of Applied Geoinformatics and Cartography, Faculty of Science, Charles University, Prague, Czech Republic. https://web.natur.cuni.cz/~bayertom. Accessed 15 May 2017
- 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
- 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.Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics). Cambridge University Press, New York (2006)Google Scholar
- 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
- 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.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.Maus, A., Drange, J.M.: All closest neighbors are proper delaunay edges generalized, and its application to parallel algorithms. In: Proceedings of Norwegian informatikkonferanse, pp. 1–12 (2010)Google Scholar
- 15.Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial tessellations: concepts and applications of Voronoi diagrams. Probability and Statistics, 2nd edn. Wiley, NYC (2000)Google Scholar
- 17.Spelič, D., Novak, F., Žalik, B.: Delaunay triangulation benchmarks. J. Electr. Eng. 59(1), 49–52 (2008)Google Scholar