Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Circle shooting in a simple polygon
Journal of Algorithms
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
A data structure for dynamically maintaining rooted trees
Journal of Algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
Segment intersection searching problems in general settings
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
The 2-center problem with obstacles
Journal of Algorithms
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Partitioning polygons into tree monotone and y-monotone subpolygons
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
| Hi-index | 0.00 |