A Method for Proving Lower Bounds for Certain Geometric Problems
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.
computer science; technical report
Previously Published As