Computing the link center of a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
The all-geodesic furthest neighbor problem for simple polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A fast Las Vegas algorithm for triangulating a simple polygon
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Compliant motion in a simple polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum partitioning simple rectilinear polygons in O(n log log n) - time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Polygon triangulation in O(n log log n) time with simple data-structures
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On solving geometric optimization problems using shortest paths
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An Optimal Algorithm for Detecting Weak Visibility of a Polygon
IEEE Transactions on Computers
Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generating triangulations at random
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Computational Geometry: Theory and Applications
Algorithms and theory of computation handbook
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Recursive calculation of relative convex hulls
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Recursive computation of minimum-length polygons
Computer Vision and Image Understanding
Weak visibility polygons of NURBS curves inside simple polygons
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |