Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
From MaRDI portal
Publication:3312804
DOI10.1109/TC.1983.1676186zbMath0531.51002MaRDI QIDQ3312804
No author found.
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
51-04: Software, source code, etc. for problems pertaining to geometry
Related Items
A fast algorithm for the alpha-connected two-center decision problem, On determining optimal strategies in pursuit games in the plane, Fuzzy distances for proximity characterization under uncertainty, An algorithm for computing the distance between two circular disks, An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\), A unifying approach for a class of problems in the computational geometry of polygons, Computing the intersection-depth to polyhedra, Point inversion and projection for nurbs curve and surface: control polygon approach, The discrete and mixed minimax 2-center problems