ScholarLens Back to search
2001•Dianzi xuebaoRequires access

A New Algorithm for Conforming Delaunay Triangulation

Yuanhua Zhou

Open publisher page 2 citations

Abstract

A new algorithm for Conforming Delaunay triangulation in 2-D is presented.The algorithm inserts points along constraint edges in order to maintain the global Delaunay criterion,while at the same time preserves the constraint edges.Compared with other strategies,our algorithm makes better use of the empty circle property in Delaunay triangulation,so that the number of extra points is greatly reduced.Corroborating experimental results are also given.

About this research paper

What this paper is about

A new algorithm for Conforming Delaunay triangulation in 2-D is presented.The algorithm inserts points along constraint edges in order to maintain the global Delaunay criterion,while at the same time preserves the constraint edges.Compared with other strategies,our algorithm makes better use of the empty circle property in Delaunay triangulation,so that the number of extra points is greatly reduced.Corroborating experimental results are also given.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new algorithm for Conforming Delaunay triangulation in 2-D is presented.The algorithm inserts points along constraint edges in order to maintain the global Delaunay criterion,while at the same time preserves the constraint edges.Compared with other strategies,our algorithm makes better use of the empty circle property in Delaunay triangulation,so that the number of extra points is greatly reduced.Corroborating experimental results are also given.

Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Chew's second algorithm, Ruppert's algorithm, Surface triangulation, Minimum-weight triangulation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Algorithm for Conforming Delaunay Triangulation — Research Paper | ScholarLens