This study presents an efficient algorithm of Delaunay triangulation by grid subdivision. The proposed algorithm show a superior performance in terms of execution time to the incremental algorithm and uniform grid method mainly due to the efficient way of searching a mate. In the proposed algorithm, uniform grids are divided into sub-grids depending on the density of points and areas with high chance of finding a mate is explored first. Most of the previous researches have focused on theoretical aspects of the triangulation, but this study presents empirical results of computer implementation in 2-dimension and 3-dimension, respectively. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Park, S. H., Lee, S. S., & Kim, J. H. (2005). The Delaunay triangulation by grid subdivision. In Lecture Notes in Computer Science (Vol. 3482, pp. 1033–1042). Springer Verlag. https://doi.org/10.1007/11424857_111
Mendeley helps you to discover research relevant for your work.