The delaunay triangulation by grid subdivision

Authors:
Si Hyung Park;Seoung Soo Lee;Jong Hwa Kim
Affiliations:
Mechanical Design and Production Engineering, Konkuk University, Seoul, Korea;CAESIT, Konkuk University, Seoul, Korea;CAESIT, Konkuk University, Seoul, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 6
Cited 5

Geometric computing and uniform grid technique

Computer-Aided Design
Incremental topological flipping works for regular triangulations

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computational geometry and computer graphics in C++

Computational geometry and computer graphics in C++
Delaunay Triangulation Using a Uniform Grid

IEEE Computer Graphics and Applications
Delaunay Triangulation in Three Dimensions

IEEE Computer Graphics and Applications
Randomized Incremental Construction of Delaunay and Voronoi Diagrams

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming

A novel algorithm for distance transformation on irregular isothetic grids

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Fast distance transformation on irregular two-dimensional grids

Pattern Recognition
Separable algorithms for distance transformations on irregular grids

Pattern Recognition Letters
A surface reconstruction algorithm using weighted alpha shapes

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Geometric techniques for 3D tracking of ultrasound sensor, tumor segmentation in ultrasound images, and 3D reconstruction

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

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.