Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Matrix searching with the shortest path metric
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Center and diameter problems in plane triangulations and quadrangulations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Separating point sets in polygonal environments
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Guarding exterior region of a simple polygon
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A unified algorithm for continuous monitoring of spatial queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Aggregate farthest-neighbor queries over spatial data
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Hi-index | 0.00 |