New Lower Bounds for Convex Hull Problems in Odd Dimensions
From MaRDI portal
Publication:4268703
DOI10.1137/S0097539797315410zbMath0939.68047MaRDI QIDQ4268703
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (6)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Tropicalizing the Simplex Algorithm ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ Preprocessing chains for fast dihedral rotations is hard or even impossible. ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Optimal Algorithms for Geometric Centers and Depth
This page was built for publication: New Lower Bounds for Convex Hull Problems in Odd Dimensions
