Delaunay triangulation using a uniform grid

Author

Fang, Tsung-Pao ; Piegl, Les A.

Author_Institution

Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA

Volume

13

Issue

3

fYear

1993

fDate

5/1/1993 12:00:00 AM

Firstpage

36

Lastpage

47

Abstract

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.<>

Keywords

computational complexity; computational geometry; data structures; mesh generation; Delaunay triangulation; convex hull; edge list; grid structure; internal data structure; tested linear time complexity; triangulating 2-D data points; triangulation strategy; uniform grid; uniform grid structure; Costs; Data structures; Grid computing; Merging; Scattering; Sorting; Testing; Upper bound;

fLanguage

English

Journal_Title

Computer Graphics and Applications, IEEE

Publisher

ieee

ISSN

0272-1716

Type

jour

DOI

10.1109/38.210490

Filename

210490