Computational geometry: an introduction
Computational geometry: an introduction
A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
Computing the link center of a simple polygon
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Finding minimal convex nested polygons
Information and Computation
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Calculating approximate curve arrangements using rounded arithmetic
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Computing the visibility polygon from a convex set and related problems
Journal of Algorithms
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) algorithm for computing the link center of a simple polygon
Discrete & Computational Geometry
Journal of Algorithms
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Rounding arrangements dynamically
Proceedings of the eleventh annual symposium on Computational geometry
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
An output sensitive algorithm for discrete convex hulls
Proceedings of the fourteenth annual symposium on Computational geometry
Guarding galleries and terrains
Information Processing Letters
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |