Sweeping lines and line segments with a heap
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Information Processing Letters
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
| Hi-index | 0.00 |