Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An Optimal Algorithm for Detecting Weak Visibility of a Polygon
IEEE Transactions on Computers
An optimal parallel algorithm for detecting weak visibility of a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient Geometric Algorithms on the EREW PRAM
IEEE Transactions on Parallel and Distributed Systems
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
Finding the shortest boundary guard of a simple polygon
Theoretical Computer Science
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Optimal Parallel Hypercube Algorithms for Polygon Problems
IEEE Transactions on Computers
Finding all weakly-visible chords of a polygon in linear time
Nordic Journal of Computing
An O(log log n) time algorithm to compute the kernel of a polygon
Nordic Journal of Computing
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Searching and on-line recognition of star-shaped polygons
Information and Computation
An Optimal Illumination Region Algorithm for Convex Polygons
IEEE Transactions on Computers
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
IEEE Transactions on Computers
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
IEEE Transactions on Computers
Algebraic and geometric approximation of waves among obstacles
Computer-Aided Design
Star-contours for efficient hierarchical self-collision detection
ACM SIGGRAPH 2010 papers
Computational Geometry: Theory and Applications
A simple linear hidden-line algorithm for star-shaped polygons
Pattern Recognition Letters
Efficient spherical parametrization using progressive optimization
CVM'12 Proceedings of the First international conference on Computational Visual Media
| Hi-index | 0.04 |