A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)

DOI10.1016/j.cam.2019.06.014zbMath1425.68432OpenAlexW2950112255MaRDI QIDQ2279854

Héctor Ferrada, Nancy Hitschfeld, Cristobal A. Navarro

Publication date: 16 December 2019

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2019.06.014

zbMATH Keywords

convex hullfiltering techniquepriority queues

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Uses Software

• CGAL
• Qhull
• 3D Convex Hulls

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of incremental convex hull algorithms in \(R^ d\)
• Another efficient algorithm for convex hulls in two dimensions
• A constant-time parallel algorithm for computing convex hulls
• Convex hull of a finite set of points in two dimensions
• A fast convex hull algorithm
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• gHull
• Finding minimal enclosing boxes
• The Ultimate Planar Convex Hull Algorithm?
• Efficient parallel convex hull algorithms
• A Lower Bound to Finding Convex Hulls
• Convex hulls of finite sets of points in two and three dimensions
• The quickhull algorithm for convex hulls
• An Algorithm for Convex Polytopes
• Encyclopedia of Distances

This page was built for publication: A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)