2009•Journal of Yangtze UniversityRequires access

Delaunay Triangulation of Complex Polygons

Haowen Yan

Abstract

This paper proposed an algorithm for Delaunay triangulation of complex polygons based on constrained edges.The algorithm first constructed the initial Delaunay triangulation of polygon vertices.Then each edge of polygon is interpolated to the existent triangulation in turn through local updating, finally the redundant triangles are removed.The algorithm is concise and the triangulation generated is in good shape.

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, Pitteway triangulation, Constrained Delaunay triangulation, Bowyer–Watson algorithm, Minimum-weight triangulation, Surface triangulation, Point set triangulation, Polygon (computer graphics)