A fast algorithm for polygon containment by translation
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 189-198
- https://doi.org/10.1007/bfb0015744
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- RetractionPublished by Association for Computing Machinery (ACM) ,1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975