MPI-INF D1 Publications
Your search returned the following 10 documents:
-
A simple entropy-based algorithm for planar point location
Sunil Arya, Theocharis Malamatos, and David M. Mount
ACM Transactions on Algorithms 3 (2): 17 p., 2007 -
Optimal expected-case planar point location
Sunil Arya, Theocharis Malamatos, David M. Mount, and Ka Chun Wong
SIAM Journal on Computing 37 (2): 584-610, 2007 -
On the Importance of Idempotence
Sunil Arya, Theocharis Malamatos, and David M. Mount
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, Seattle, Washington, USA, 2006, 564-573 -
The Effect of Corners on the Complexity of Approximate Range Searching
Sunil Arya, Theocharis Malamatos, and David M. Mount
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, Sedona, Arizona, USA, 2006, 11-20 -
Space-Time Tradeoffs for Approximate Spherical Range Counting
Sunil Arya, Theocharis Malamatos, and David M. Mount
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 535-544 -
Approximate range searching
Sunil Arya and David M. Mount
Computational Geometry 17 (3/4): 135-152, 2000 -
Accounting for boundary effects in nearest neighbor searching
Sunil Arya, David M. Mount, and Oruttom Narayan
Discrete & Computational Geometry 16 (2): 155-176, 1996 -
Accounting for boundary effects in nearest neighbor searching
Sunil Arya, David M. Mount, and Oruttom Narayan
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, 336-344 -
Approximate range searching
Sunil Arya and David M. Mount
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, USA, June, 5th - 7th, 1995, 172-181 -
Euclidean spanners: short, thin, and lanky
Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, and Michiel Smid
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), Las Vegas, Nevada, USA, May, 29th - June, 1st, 1995, 489-498