ScholarLens Back to search
2014•Computer ScienceOpen access

An Algorithm of Semi-Delaunay Triangulation of Points Cloud Scattered on a Surface

K. M. Jan

Open full text 0 citations

Abstract

The purpose of the paper is to generalize the Delaunay triangulation onto surfaces. A formal definition and appropriate algorithm are presented. Starting from plane domain Delaunay triangulation definition a theoretical approach is evolved which is a background for further considerations. It is proved that in case of plane surface the introduced Delaunay triangulation of surfaces is identical with classical Delaunay triangulation of plane domain. The proposed algorithm is implemented and numerical results are shown.

Open-access reader

About this research paper

What this paper is about

The purpose of the paper is to generalize the Delaunay triangulation onto surfaces. A formal definition and appropriate algorithm are presented. Starting from plane domain Delaunay triangulation definition a theoretical approach is evolved which is a background for further considerations. It is proved that in case of plane surface the introduced Delaunay triangulation of surfaces is identical with classical Delaunay triangulation of plane domain. The proposed algorithm is implemented and numerical results are shown.

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

The purpose of the paper is to generalize the Delaunay triangulation onto surfaces. A formal definition and appropriate algorithm are presented. Starting from plane domain Delaunay triangulation definition a theoretical approach is evolved which is a background for further considerations. It is proved that in case of plane surface the introduced Delaunay triangulation of surfaces is identical with classical Delaunay triangulation of plane domain. The proposed algorithm is implemented and numerical results are shown.

Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Surface triangulation, Point set triangulation, Computer science, Triangulation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Algorithm of Semi-Delaunay Triangulation of Points Cloud Scattered on a Surface — Research Paper | ScholarLens