2012•Computer and Digital EngineeringRequires access

Study on Algorithm for the Triangulation of Arbitrary Polygons Based on Delaunay Trigonometry Network

Wang Chun

Abstract

The paper introduces an improved algorithm for the triangulation of arbitrary polygons based on the Delaunay by analyzing the existing algorithms for the triangulation of the polygons.This algorithm firstly regardes the polygon vertices as scattered points by ignoring the logical relationship between polygon vertices and sides.And then,it created reasonable trigonometry network by Delaunay triangulation for the scattered points.At last,by eliminating the unreasonable triangular mesh based on the logical relationship between polygon vertices and sides,the reasonable triangulation of arbitrary polygons is created.

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