Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Farthest neighbors and center points in the presence of rectngular obstacles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Planar rectilinear shortest path computation using corridors
Computational Geometry: Theory and Applications
Hi-index | 0.00 |