Author of the publication

Kinetic and dynamic data structures for closest pair and all nearest neighbors.

, , and . ACM Trans. Algorithms, 5 (1): 4:1-4:37 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computing Shortest Paths in the Plane with Removable Obstacles., , , and . SWAT, volume 101 of LIPIcs, page 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Near-Quadratic Algorithm for Fence Design., , and . Discret. Comput. Geom., 33 (3): 463-481 (2005)Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D., , , , , , and . Discret. Comput. Geom., 39 (1-3): 17-37 (2008)Star Unfolding of a Polytope with Applications (Extended Abstract)., , , and . SWAT, volume 447 of Lecture Notes in Computer Science, page 251-263. Springer, (1990)Efficient algorithms for bichromatic separability., , and . ACM Trans. Algorithms, 2 (2): 209-227 (2006)Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons., , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 315-327. Springer, (2005)Modeling and Analyzing Massive Terrain Data Sets.. ISAAC, volume 4835 of Lecture Notes in Computer Science, page 1. Springer, (2007)Approximation Algorithms for k-Line Center., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 54-63. Springer, (2002)Computing a Center-Transversal Line., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 93-104. Springer, (2006)Arrangements and Their Applications., and . Handbook of Computational Geometry, North Holland / Elsevier, (2000)