Incremental convex hull algorithms are not output sensitive

DOI10.1007/PL00009410zbMath0924.68192MaRDI QIDQ1283741

David Bremner

Publication date: 30 March 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex hull problemconvex hull algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items

How good are convex hull algorithms?, Convex hulls, oracles, and homology, Computing convex hulls and counting integer points with \texttt{polymake}, A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations, Multiparametric linear programming with applications to control, Generating all vertices of a polyhedron is hard