Algorithm: Beneath-and-Beyond incremental convex hull construction

MaRDI QIDQ6825363FDO

Incremental primal convex hull: insert points, find visible facets, and update the facet complex. Efficient in low to moderate dimensions and forms the basis of many practical codes.

Described by source

• Computing convex hulls and counting integer points with polymake
• How good are convex hull algorithms?
• Linear programming and convex hulls made easy

This page was built for algorithm: Algorithm: Beneath-and-Beyond incremental convex hull construction