New Lower Bounds for Convex Hull Problems in Odd Dimensions
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4) , 1198-1214
- https://doi.org/10.1137/s0097539797315410
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi DiagramsDiscrete & Computational Geometry, 1997
- How good are convex hull algorithms?Computational Geometry, 1997
- Output-sensitive results on convex hulls, extreme points, and related problemsDiscrete & Computational Geometry, 1996
- Optimal output-sensitive convex hull algorithms in two and three dimensionsDiscrete & Computational Geometry, 1996
- How hard are n 2 -hard problems?ACM SIGACT News, 1994
- Ray Shooting and Parametric SearchSIAM Journal on Computing, 1993
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- Some NP-complete problems in linear programmingOperations Research Letters, 1982
- The orchard problemGeometriae Dedicata, 1974
- An Algorithm for Convex PolytopesJournal of the ACM, 1970