Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fang, T.-P., Piegl, L.A.: Delaunay Triangulation Using a Uniform Grid. IEEE Computer Graphics and Applications 13(3), 36–47 (1993)
Fang, T.-P., Piegl, L.A.: Delaunay Triangulation in Three Dimensions. IEEE Computer Graphics and Applications 15(5), 62–69 (1995)
Edelsbrunner, H., Shah, N.R.: Incremental topological flipping works for regular triangulations. In: Proceedings of the 8th Annual ACM Symposium on Computational Geometry, pp. 43–52 (1992)
Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 414–431. Springer, Heidelberg (1990)
McLain, D.H.: Two dimensional interpolation from random data. The Computer J. 19(2), 178–181 (1976)
Dobkin, D.P., Laszlo, M.J.: Primitives for the manipulation of three-dimensional subdivisions. Algorithmica 4, 3–32 (1989)
Lee, D.T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. of Computer and Information Science 9(3) (1980)
Cignoni, P., Montani, C., Scopigno, R.: DeWall: A Fast Divide and Conquer Delaunay Triangulation Algorithm in Eb. Computer-Aided Design 30(5), 333–341 (1998)
Akman, V., Franklin, W.R., Kankanhalli, M., Narayanaswami, C.: Geometric computing and uniform grid technique. Computer-Aided Design 21(7), 410–420 (1989)
Kim, D.-S., Hwang, I.-K., Park, B.-J.: Representing the Voronoi Diagram of a Simple Polygon using Rational Quadratic Bezier Curves. Computer Aided Design 27(8), 605–614 (1995)
Laszlo, M.J.: Computational Geometry and Computer Graphics in C++. Prentice-Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, S.H., Lee, S.S., Kim, J.H. (2005). The Delaunay Triangulation by Grid Subdivision. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_111
Download citation
DOI: https://doi.org/10.1007/11424857_111
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)