ScholarLens Back to search
2008•Unpublished venueRequires access

A Fast Algorithm for Computing Convex Hull of Three-Dimensional Point Set Based on Triangular

Xie Bu-ying

Open publisher page 0 citations

Abstract

The minimum convex hull is one of the widely studied problems in science of computing geometry,as well as extensively applied in many field of architectural modeling and GIS(Geographic Information System). One of the common algorithm for computing spatial convex hull has been discussed. In order to increase operation speed,a new method is put forward based on loop,then the algorithm complexity analysis and experimental comparison will be done,on which do the curve fitting to proof the unity of theory and practice and the high efficiency of the algorithm.

About this research paper

What this paper is about

The minimum convex hull is one of the widely studied problems in science of computing geometry,as well as extensively applied in many field of architectural modeling and GIS(Geographic Information System). One of the common algorithm for computing spatial convex hull has been discussed. In order to increase operation speed,a new method is put forward based on loop,then the algorithm complexity analysis and experimental comparison will be done,on which do the curve fitting to proof the unity of theory and practice and the high efficiency of the algorithm.

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

The minimum convex hull is one of the widely studied problems in science of computing geometry,as well as extensively applied in many field of architectural modeling and GIS(Geographic Information System). One of the common algorithm for computing spatial convex hull has been discussed. In order to increase operation speed,a new method is put forward based on loop,then the algorithm complexity analysis and experimental comparison will be done,on which do the curve fitting to proof the unity of theory and practice and the high efficiency of the algorithm.

Key concepts: Convex hull, Hull, Output-sensitive algorithm, Point (geometry), Convex set, Set (abstract data type), Algorithm, Regular polygon

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Algorithm for Computing Convex Hull of Three-Dimensional Point Set Based on Triangular — Research Paper | ScholarLens