Computational geometry: an introduction
Computational geometry: an introduction
On shortest paths in polyhedral spaces
SIAM Journal on Computing
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
On some distance problems in fixed orientations
SIAM Journal on Computing
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
SCG '87 Proceedings of the third annual symposium on Computational geometry
SIAM Journal on Computing
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Proximity and reachability in the plane.
Proximity and reachability in the plane.
| Hi-index | 0.00 |