A manual comparison of convex hull algorithms (multimedia exposition)

DOI10.4230/LIPICS.SOCG.2019.65MaRDI QIDQ5088998zbMATH OpenFDO

Authors Maarten Löffler

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2019.65

zbMATH Keywords

convex hullefficiency

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Some performance tests of convex hull algorithms
• A modification of Graham's algorithm for determining the convex hull of a finite planar set
• Convex-hull algorithms: implementation, testing, and experimentation
• An efficient and numerically correct algorithm for the 2D convex hull problem
• A new algorithm for computing the convex hull of a planar point set

Cites work

• An efficient algorithm for determining the convex hull of a finite planar set
• Another efficient algorithm for convex hulls in two dimensions
• Computational geometry. Algorithms and applications.

This page was built for publication: A manual comparison of convex hull algorithms (multimedia exposition)

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