ScholarLens Back to search
2007•Jisuanji gongchengRequires access

Research and Improvement of Convex Hull Algorithm in Construction of Delaunay Triangulation

Tingting Chen

Open publisher page 0 citations

Abstract

While infroducing the essential meaning and the data structure of TIN,this paper studies and improves the Graham algorithm which constructs the convex hull based on the plane discrete points,proposes one “slope-scan-line” method,and a programming algorithm is achieved also.Experimental results show that the method is easy to obtain and to understand.It is effective to build Delaunay TIN.

About this research paper

What this paper is about

While infroducing the essential meaning and the data structure of TIN,this paper studies and improves the Graham algorithm which constructs the convex hull based on the plane discrete points,proposes one “slope-scan-line” method,and a programming algorithm is achieved also.Experimental results show that the method is easy to obtain and to understand.It is effective to build Delaunay TIN.

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

While infroducing the essential meaning and the data structure of TIN,this paper studies and improves the Graham algorithm which constructs the convex hull based on the plane discrete points,proposes one “slope-scan-line” method,and a programming algorithm is achieved also.Experimental results show that the method is easy to obtain and to understand.It is effective to build Delaunay TIN.

Key concepts: Delaunay triangulation, Convex hull, Computer science, Algorithm, Triangulation, Hull, Bowyer–Watson algorithm, Regular polygon

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research and Improvement of Convex Hull Algorithm in Construction of Delaunay Triangulation — Research Paper | ScholarLens