Pages that link to "Item:Q1283741"
From MaRDI portal
The following pages link to Incremental convex hull algorithms are not output sensitive (Q1283741):
Displaying 6 items.
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Multiparametric linear programming with applications to control (Q2512098) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)