Randomized quickhull

DOI10.1007/BF02523195zbMath0865.68123OpenAlexW3190573802MaRDI QIDQ675302

Juan-Miguel Gracia

Publication date: 6 March 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02523195

zbMATH Keywords

convex hullrandomized algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Distribution-sensitive algorithms ⋮ Space-efficient planar convex hull algorithms ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ Random convex hulls and extreme value statistics

Cites Work

• Unnamed Item
• Unnamed Item
• Comments on a lower bound for convex hull determination
• How to reduce the average complexity of convex hull finding algorithms
• A more efficient convex hull algorithm
• Convex hull of a finite set of points in two dimensions
• A fast convex hull algorithm
• Divide and conquer for linear expected time
• New applications of random sampling in computational geometry
• Applications of random sampling in computational geometry. II
• 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
• Constructing the convex hull of a set of points in the plane
• The Ultimate Planar Convex Hull Algorithm?
• A Randomized Algorithm for Closest-Point Queries
• A Lower Bound to Finding Convex Hulls
• A New Convex Hull Algorithm for Planar Sets

This page was built for publication: Randomized quickhull