Article

The delaunay triangulation by grid subdivision

Authors:

ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

Pages 1033 - 1042

https://doi.org/10.1007/11424857_111

Published: 09 May 2005 Publication History

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.

References

[1]

Tsung-Pao Fang, Les A. Piegl : Delaunay Triangulation Using a Uniform Grid. IEEE Computer Graphics and Applications, Vol. 13, No. 3 (1993) 36-47

Digital Library

Google Scholar

[2]

Tsung-Pao Fang, Les A. Piegl : Delaunay Triangulation in Three Dimensions. IEEE Computer Graphics and Applications, Vol. 15, No. 5 (1995) 62-69

Digital Library

Google Scholar

[3]

H. Edelsbrunner, N. R. Shah : Incremental topological flipping works for regular triangulations. In Proceedings of the 8th Annual ACM Symposium on Computational Geometry (1992) 43-52

Digital Library

Google Scholar

[4]

L. J. Guibas, D. E. Knuth, M. Sharir : Randomized incremental construction of Delaunay and Voronoi diagrams. In Automata, Languages and Programming, LNSC N.443, Springer-Verlag (1990) 414-431

Digital Library

Google Scholar

[5]

D. H. McLain : Two dimensional interpolation from random data. The Computer J., 19(2) (1976) 178-181

Crossref

Google Scholar

[6]

D. P. Dobkin, M. J. Laszlo : Primitives for the manipulation of three-dimensional subdivisions. Algorithmica, 4:3-32 (1989)

Digital Library

Google Scholar

[7]

D. T Lee and B. J. Schachter : Two algorithms for constructing a Delaunay triangulation. Int. J. of Computer and Information Science, 9(3) (1980)

Crossref

Google Scholar

[8]

P. Cignoni, C. Montani, R. Scopigno : DeWall : A Fast Divide and Conquer Delaunay Triangulation Algorithm in Eb", Computer-Aided Design, Vol. 30, No. 5 (1998) 333-341 9. V. Akman, W. R. Franklin, M. Kankanhalli, C. Narayanaswami : Geometric computing and uniform grid technique. Computer-Aided Design, 21(7) (1989) 410-420

Digital Library

Google Scholar

[9]

V. Akman, W. R. Franklin, M. Kankanhalli, C. Narayanaswami : Geometric computing and uniform grid technique. Computer-Aided Design, 21(7) (1989) 410-420

Digital Library

Google Scholar

[10]

Deok-Soo Kim, Il-Kyu Hwang, Bum-Joo Park : Representing the Voronoi Diagram of a Simple Polygon using Rational Quadratic Bezier Curves. Computer Aided Design Vol. 27, No. 8 (1995) 605-614

Crossref

Google Scholar

[11]

Michael J. Laszlo : Computational Geometry and Computer Graphics in C++. Prentice Hall. (1996)

Digital Library

Google Scholar

Cited By

View all

Vacavant ACoeurjolly DTougne L(2011)Separable algorithms for distance transformations on irregular gridsPattern Recognition Letters10.1016/j.patrec.2010.11.01032:9(1356-1364)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.patrec.2010.11.010
Vacavant ACoeurjolly DTougne L(2009)A novel algorithm for distance transformation on irregular isothetic gridsProceedings of the 15th IAPR international conference on Discrete geometry for computer imagery10.5555/1813270.1813316(469-480)Online publication date: 30-Sep-2009
https://dl.acm.org/doi/10.5555/1813270.1813316
Park SLee SKim J(2005)A surface reconstruction algorithm using weighted alpha shapesProceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I10.1007/11539506_143(1141-1150)Online publication date: 27-Aug-2005
https://dl.acm.org/doi/10.1007/11539506_143

Index Terms

The delaunay triangulation by grid subdivision
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

A spectral characterization of the Delaunay triangulation

The Delaunay triangulation of a planar point set is a fundamental construct in computational geometry. A simple algorithm to generate it is based on flips of diagonal edges in convex quads. We characterize the effect of a single edge flip in a ...
Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation

A fast unstructured mesh generation algorithm based on conforming centroidal Voronoi Delaunay triangulation (CfCVDT) algorithm (Ju, 2007) is proposed in this paper. In the new algorithm, the constrained Delaunay triangulation (CDT) algorithm is used ...
Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation

Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing ''bad'' triangles on boundaries. In the ...

Comments

Information & Contributors

Information

Published In

ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III

May 2005

1325 pages

ISBN:3540258620

Editors:
Osvaldo Gervasi
Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, Perugia, Italy
,
Marina L. Gavrilova
Department of Computer Science, University of Calgary, 2500 University Drive N.W., Calgary, AB, Canada
,
Vipin Kumar
William Norris Professor, Head of the Computer Science and Engineering, Department University of Minnesota, 2500 University Drive N.W., Calgary, AB, Canada
,
Antonio Laganà
Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, Perugia, AB, Italy
,
Heow Pueh Lee
Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, Perugia, AB, Singapore

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 09 May 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vacavant ACoeurjolly DTougne L(2011)Separable algorithms for distance transformations on irregular gridsPattern Recognition Letters10.1016/j.patrec.2010.11.01032:9(1356-1364)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.patrec.2010.11.010
Vacavant ACoeurjolly DTougne L(2009)A novel algorithm for distance transformation on irregular isothetic gridsProceedings of the 15th IAPR international conference on Discrete geometry for computer imagery10.5555/1813270.1813316(469-480)Online publication date: 30-Sep-2009
https://dl.acm.org/doi/10.5555/1813270.1813316
Park SLee SKim J(2005)A surface reconstruction algorithm using weighted alpha shapesProceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I10.1007/11539506_143(1141-1150)Online publication date: 27-Aug-2005
https://dl.acm.org/doi/10.1007/11539506_143

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A spectral characterization of the Delaunay triangulation

Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation

Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation