Incremental convex hull algorithms are not output sensitive

DOI10.1007/PL00009410MaRDI QIDQ1283741zbMATH OpenFDO

Authors David Bremner

Publication date 30 March 1999

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

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

zbMATH Keywords

convex hull algorithmsconvex hull problem

Mathematics Subject Classification ID

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

Recommendations

• Incremental convex hull algorithms are not output sensitive
• How good are convex hull algorithms?
• Output-sensitive results on convex hulls, extreme points, and related problems
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• scientific article; zbMATH DE number 1182912

Cited in

(12)

• How good are convex hull algorithms?
• An output sensitive algorithm for discrete convex hulls
• Output-sensitive results on convex hulls, extreme points, and related problems
• Computing convex hulls and counting integer points with \texttt{polymake}
• Multiparametric linear programming with applications to control
• Convex hulls, oracles, and homology
• Generating all vertices of a polyhedron is hard
• Incremental convex hull algorithms are not output sensitive
• Infinite state model checking by learning transitive relations
• Tropical Fréchet means: a polyhedral approach to exact optimization
• Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms
• Tropical Fréchet means

This page was built for publication: Incremental convex hull algorithms are not output sensitive

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