Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons

DOI10.1109/TC.1983.1676186zbMath0531.51002MaRDI QIDQ3312804

No author found.

Publication date: 1983

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

convex polygonintersection detection problemminimum distance between two polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Software, source code, etc. for problems pertaining to geometry (51-04)

Related Items

Computing the intersection-depth to polyhedra ⋮ An optimal algorithm for finding the separation of simple polygons ⋮ A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects ⋮ Point inversion and projection for nurbs curve and surface: control polygon approach ⋮ A plane-sweep algorithm for finding a closest pair among convex planar objects ⋮ The discrete and mixed minimax 2-center problems ⋮ An algorithm for computing the distance between two circular disks ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ An approach to computing multipoint inversion and multiray surface intersection on parametric surface ⋮ On determining optimal strategies in pursuit games in the plane ⋮ A unifying approach for a class of problems in the computational geometry of polygons ⋮ Fuzzy distances for proximity characterization under uncertainty ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)