A modification of Graham's algorithm for determining the convex hull of a finite planar set

zbMATH Open1135.52303MaRDI QIDQ3499323FDOQ3499323

Authors: Phan Thanh An 

Publication date: 29 May 2008

Full work available at URL: https://eudml.org/doc/128821

Recommendations

• A modification of Graham's algorithm for the convexification of a positive-uniform function
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• Quicker than Quickhull
• Some performance tests of convex hull algorithms
• A new algorithm for computing the convex hull of a planar point set

zbMATH Keywords

computational complexityalgorithmconvex hullextreme pointGraham scan

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial complexity of geometric structures (52C45)

Cited In (5)

• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• Some performance tests of convex hull algorithms
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets
• A parallel algorithm based on convexity for the computing of Delaunay tessellation
• A modification of Graham's algorithm for the convexification of a positive-uniform function

This page was built for publication: A modification of Graham's algorithm for determining the convex hull of a finite planar set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499323)