Subscribe

Issue No.03 - May/June (1993 vol.13)

pp: 36-47

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.210490

ABSTRACT

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

CITATION

Tsung-Pao Fang, Les A. Piegl, "Delaunay Triangulation Using a Uniform Grid",

*IEEE Computer Graphics and Applications*, vol.13, no. 3, pp. 36-47, May/June 1993, doi:10.1109/38.210490REFERENCES