An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Detection is easier than computation (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
IEEE Transactions on Computers
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Computing the Penetration Depth of Two Convex Polytopes in 3D
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Evaluation of Buffer Queries in Spatial Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
| Hi-index | 14.98 |
Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.