Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We prove lower bounds for a number of geometric problems. Our results show that certain types of additional input information cannot possibly permit faster solutions for these problems. The main idea in all our lower bound proofs is the use of the index of a point as an additional coordinate.