Author of the publication

Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats.

, , and . ESA, volume 87 of LIPIcs, page 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Sparsification of motion-planning roadmaps by edge contraction., , , and . ICRA, page 4098-4105. IEEE, (2013)Durable Top-k Queries on Temporal Data., , and . Proc. VLDB Endow., 11 (13): 2223-2235 (2018)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)Counting Facets and Incidences., and . Discret. Comput. Geom., (1992)Efficient Randomized Algorithms for Some Geometric. Optimization Problems., and . Discret. Comput. Geom., 16 (4): 317-337 (1996)Parititoning Arrangements of Lines II: Applications.. Discret. Comput. Geom., (1990)Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions., and . Discret. Comput. Geom., 24 (4): 645-657 (2000)Can Visibility Graphs Be Represented Compactly?., , , and . Discret. Comput. Geom., (1994)Approximation algorithms for layered manufacturing., and . SODA, page 528-537. ACM/SIAM, (2000)Open Problems Presented at SCG'98., , and . J. Algorithms, 30 (2): 449-453 (1999)