2000•Fuzhou daxue xuebao. Ziran kexue banRequires access

New algorithm of computing Delaunnay triangulation

Xie Huo-sheng

Abstract

A new algorithm of computing Delaunay triangulation of data point set convex hull in known K dimension Euclidean pace is presented. By introducing assistant infinite triangle and Delaunay triangulation, this new algorithm assures that its running result is entirely Delaunay triangulation and overcomes Bowyer's algorithmic limitations. Besides, this new algorithm has on-line property and is applicable to dynamic data point set.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

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