ScholarLens Back to search
2008•Computer and Information TechnologyRequires access

A Fast Algorithm for Convex Hull of the Planar Points

Cao Jian

Open publisher page 0 citations

Abstract

A fast algorithm for convex hull of the planar points is presented.The algorithm firstly makes the discrete points sorted in scan manner,construct the initial convex hull,then add the rest of the discrete points to the convex hull which has been created and generate a new convex hull.Experiments show that the algorithm has a good efficiency.

About this research paper

What this paper is about

A fast algorithm for convex hull of the planar points is presented.The algorithm firstly makes the discrete points sorted in scan manner,construct the initial convex hull,then add the rest of the discrete points to the convex hull which has been created and generate a new convex hull.Experiments show that the algorithm has a good efficiency.

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

A fast algorithm for convex hull of the planar points is presented.The algorithm firstly makes the discrete points sorted in scan manner,construct the initial convex hull,then add the rest of the discrete points to the convex hull which has been created and generate a new convex hull.Experiments show that the algorithm has a good efficiency.

Key concepts: Convex hull, Orthogonal convex hull, Output-sensitive algorithm, Convex polytope, Convex combination, Convex set, Algorithm, Hull

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Algorithm for Convex Hull of the Planar Points — Research Paper | ScholarLens