2010•Gnss World of ChinaRequires access

Research and Realizing of Algorithm in Construction of Delaunay Triangulation with Boundary Conditions

Zhang Li

Abstract

Delaunay triangulation is the main route of construct digital terrain model,convex hull is the basic of construct Delaunay triangulation,general search convex hull method only find the polygon with least points,but more points at one edge exist.The paper proposed a new way finding convex hull and deduses the algorithm of construct delaunay triangulation with boundary conditions on the basis of the algorithm of construct delaunay triangulation.Through the test with actual data,this algorithm is effective.

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, Minimum-weight triangulation, Bowyer–Watson algorithm, Surface triangulation, Convex hull, Chew's second algorithm