A Comparative Research on Methods of Delaunay Triangulation
Yu Jie
Abstract
Yu Jie
Abstract
Delaunay triangulation reconstruction is a hotspot but hard problem in 3D scene rendering and visualization field.In this paper,a review of Delaunay triangulation development is given,and then three current kinds of Delaunay triangulation methods are summarized: incremental method,triangle expanding method and divide-and-conquer method.Moreover,several kinds of algorithms under the frame of each triangulation method are compared in terms of advantage,disadvantage and complexity.Finally,directions of future work of Delaunay triangulation methods in large-scale scene rendering and terrain visualization field have been discussed,including research on algorithm combination,algorithm supporting technology and distributed parallel algorithm.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Delaunay triangulation reconstruction is a hotspot but hard problem in 3D scene rendering and visualization field.In this paper,a review of Delaunay triangulation development is given,and then three current kinds of Delaunay triangulation methods are summarized: incremental method,triangle expanding method and divide-and-conquer method.Moreover,several kinds of algorithms under the frame of each triangulation method are compared in terms of advantage,disadvantage and complexity.Finally,directions of future work of Delaunay triangulation methods in large-scale scene rendering and terrain visualization field have been discussed,including research on algorithm combination,algorithm supporting technology and distributed parallel algorithm.
Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Surface triangulation, Computer science, Minimum-weight triangulation, Point set triangulation