Computing the extreme distances between two convex polygons
Journal of Algorithms
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
Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Placing the largest similar copy of a convex polygon among polygonal obstacles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Circular separability of polygon
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Kinetic collision detection between two simple polygons
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Separation Sensitive Kinetic Separation Structures for Convex Polygons
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Generalized penetration depth computation
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Generalized penetration depth computation
Computer-Aided Design
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Algorithms and theory of computation handbook
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Hi-index | 0.00 |
A simple algorithm is presented for detecting whether two preprocessed simple polygons intersect one another. Given a simple polygon, A, in O(n log n) time and O(n) space we preprocess A constructing an enveloping triangulation called a scaffold. To determine whether two preprocessed polygons A and B overlap another, we start with these two envelopes and successively strip away overlapping triangles of the scaffolds until we either detect an intersection between the objects or until we have succeeded in separating them spatially. The running time of the intersection query depends on the complexity of the minimum link polygonal curve separating the two objects. Given two preprocessed simple polygons A and B, placed at arbitrary locations in the plane we can determine whether these polygons intersect one another in O(m log2n is the total number of vertices and m is the complexity of a minimum link polygonal curve separating A from B. We generalize this to the problem of computing arbitrary Boolean functions of two preprocessed polygons.