Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Color red and blue the n vertices of a convex polytope $\mathcal{P}$ in ℝ3. Can we compute the convex hull of each color class in o(nlog n) time? What if we have more than two colors? What if the colors are random? Consider an arbitrary query halfspace and call the vertices of $\mathcal{P}$ inside it blue: can the convex hull of the blue points be computed in time linear in their number? More generally, can we quickly compute the blue hull without looking at the whole polytope? This paper considers several instances of hereditary computation and provides new results for them. In particular, we resolve an eight-year old open problem by showing how to split a convex polytope in linear expected time.