Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- 1 December 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (12) , 1203-1207
- https://doi.org/10.1109/tc.1983.1676186
Abstract
Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.Keywords
This publication has 6 references indexed in Scilit:
- Finding the minimum distance between two convex polygonsInformation Processing Letters, 1981
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- Geometric intersection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975