Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Manhattonian proximity in a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On the Complexity of Two Circle Strongly Connecting Problems
IEEE Transactions on Computers
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
SCG '93 Proceedings of the ninth 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
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geodesic Voronoi diagrams in the presence of rectilinear barriers
Nordic Journal of Computing
Centroidal Voronoi diagrams for isotropic surface remeshing
Graphical Models - Special issue on SMI 2003
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.89 |