Data structures and network algorithms
Data structures and network algorithms
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
A data structure for dynamic trees
Journal of Computer and System Sciences
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Introduction to algorithms
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Dynamization of geometric data structures
SCG '85 Proceedings of the first annual symposium on Computational geometry
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
An algorithm to compute the Minkowski sum outer-face of two simple polygons
Proceedings of the twelfth annual symposium on Computational geometry
Efficiently approximating polygonal paths in three and higher dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Automatic generation of triangular irregular networks using greedy cuts
VIS '95 Proceedings of the 6th conference on Visualization '95
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Computing a maxian point of a simple rectilinear polygon
Operations Research Letters
| Hi-index | 0.00 |