| Stochastic Analysis of Empty-Region Graphs. | 0 | 0.34 | 2021 |
| Hardness results on Voronoi, Laguerre and Apollonius diagrams. | 0 | 0.34 | 2019 |
| Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions. | 0 | 0.34 | 2017 |
| Monotone Simultaneous Embeddings of Paths in R^d. | 0 | 0.34 | 2016 |
| Qualitative Symbolic Perturbation. | 0 | 0.34 | 2016 |
| On the Smoothed Complexity of Convex Hulls | 1 | 0.40 | 2015 |
| ESQ: Editable SQuad Representation for Triangle Meshes | 2 | 0.37 | 2012 |
| Simple and Efficient Distribution-Sensitive Point Location, in Triangulations. | 3 | 0.43 | 2011 |
| Oja medians and centers of gravity | 0 | 0.34 | 2010 |
| Dynamic updates of succinct triangulations | 5 | 0.48 | 2005 |
| Anisotropic polygonal remeshing. | 1 | 0.35 | 2003 |
| The Delaunay Hierarchy | 35 | 1.74 | 2002 |
| Separating several point sets in the plane | 4 | 0.65 | 2001 |
| Computing Largest Circles Separating Two Sets of Segments | 12 | 1.29 | 2000 |
| Motion planning of legged robots | 16 | 1.38 | 1999 |
| The union of unit balls has quadratic complexity, even if they all contain the origin | 1 | 0.36 | 1999 |
| Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract) | 5 | 0.45 | 1997 |
| Computational geometry and discrete computations | 2 | 0.41 | 1996 |
| Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes | 6 | 0.65 | 1996 |
| Motion Planning Of Legged Robots - The Spider Robot Problem | 3 | 0.66 | 1995 |
| Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points | 7 | 1.53 | 1994 |
| Convex Tours on Bounded Curvature | 3 | 0.68 | 1994 |
| Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers | 8 | 0.83 | 1993 |
| Applications of random sampling to on-line algorithms in computational geometry | 58 | 8.06 | 1992 |
| Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems | 12 | 0.99 | 1992 |
