How good are convex hull algorithms?

DOI/10.1016/S0925-7721(96)00023-5MaRDI QIDQ6824426FDO

Authors David Avis, David Bremner, Raimund Seidel

Publication date April 1997

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org//10.1016/S0925-7721(96)00023-5

Cited in

(4)

• Algorithm: Beneath-and-Beyond incremental convex hull construction
• Algorithm: Quickhull for convex hulls in general dimensions (proposed)
• Algorithm: Reverse search for vertex enumeration (Avis–Fukuda)
• Algorithm: Double Description method for vertex and extreme-ray enumeration

This page was built for publication: How good are convex hull algorithms?

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