Delaunay triangulation using a uniform grid

An algorithm for triangulating 2-D data points that is based on a uniform grid structure and a triangulation strategy that builds triangles in a circular fashion is discussed. The triangulation strategy lets the algorithm eliminate points from the internal data structure and decreases the time used...

Full description

Saved in:
Bibliographic Details
Published inIEEE computer graphics and applications Vol. 13; no. 3; pp. 36 - 47
Main Authors Fang, T.-P., Piegl, L.A.
Format Magazine Article
LanguageEnglish
Published New York, NY IEEE 01.05.1993
IEEE Computer Society
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Costs
Data structures
Exact sciences and technology
Grid computing
Merging
Pattern recognition. Digital image processing. Computational geometry
Scattering
Sorting
Testing
Upper bound
Convex hull
Two dimensional space
Experimental result
Triangulation
Data structure
Algorithm
Time complexity
Implementation
Online AccessGet full text

Cover

More Information
Summary:An algorithm for triangulating 2-D data points that is based on a uniform grid structure and a triangulation strategy that builds triangles in a circular fashion is discussed. The triangulation strategy lets the algorithm eliminate points from the internal data structure and decreases the time used to find points to form triangles, given an edge. The algorithm has a tested linear time complexity that significantly improves on that of other methods. As a by-product, the algorithm produces the convex hull of the data set at no extra cost. Two ways to compute the convex hull using the algorithm are presented. The first is based on the edge list and the second is based on the grid structure.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0272-1716
1558-1756
DOI:10.1109/38.210490