Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Approximating largest convex hulls for imprecise points
Journal of Discrete Algorithms
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry: Theory and Applications
Approximating largest convex hulls for imprecise points
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Point distance and orthogonal range problems with dependent geometric uncertainties
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Almost all Delaunay triangulations have stretch factor greater than π/2
Computational Geometry: Theory and Applications
Preprocessing Imprecise Points and Splitting Triangulations
SIAM Journal on Computing
Largest and smallest tours and convex hulls for imprecise points
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Some properties of k-Delaunay and k-Gabriel graphs
Computational Geometry: Theory and Applications
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.90 |