ScholarLens Back to search
2004•Jisuanji yingyong yanjiuRequires access

A Study on Algorithm of Delaunay Triangulation for the Constrained Data Set and Application

Shaohua Liu, Cheng Peng-gen, Zhao Bao-gui

Open publisher page 0 citations

Abstract

This paper researches the algorithm of the constrained delaunay triangulation net generation .This algorithm makes use of virtues of divide-conquer algorithm and triangulation growth algorithm,adopting clump organization to establish grid index for separate points,edges and triangles that are generated real-time in constructing TIN.It is effective to reduce the time of searching goal points and triangles,and improves the speed of constructing TIN. This algorithm is applied to Construction of terrain surface model ,which realizes 3D visualization.

About this research paper

What this paper is about

This paper researches the algorithm of the constrained delaunay triangulation net generation .This algorithm makes use of virtues of divide-conquer algorithm and triangulation growth algorithm,adopting clump organization to establish grid index for separate points,edges and triangles that are generated real-time in constructing TIN.It is effective to reduce the time of searching goal points and triangles,and improves the speed of constructing TIN. This algorithm is applied to Construction of terrain surface model ,which realizes 3D visualization.

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

This paper researches the algorithm of the constrained delaunay triangulation net generation .This algorithm makes use of virtues of divide-conquer algorithm and triangulation growth algorithm,adopting clump organization to establish grid index for separate points,edges and triangles that are generated real-time in constructing TIN.It is effective to reduce the time of searching goal points and triangles,and improves the speed of constructing TIN. This algorithm is applied to Construction of terrain surface model ,which realizes 3D visualization.

Key concepts: Delaunay triangulation, Computer science, Triangulated irregular network, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Triangulation, Algorithm, Grid

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Study on Algorithm of Delaunay Triangulation for the Constrained Data Set and Application — Research Paper | ScholarLens