Minimum vertex distance between separable convex polygons

DOI10.1016/0020-0190(84)90073-5zbMath0533.68068OpenAlexW2080303510MaRDI QIDQ789904

N. E. Zubov

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90073-5

zbMATH Keywords

optimal algorithmminimum vertex distanceseparable convex polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

A unifying approach for a class of problems in the computational geometry of polygons

Cites Work

• Unnamed Item
• Fast detection of polyhedral intersection
• Finding the intersection of two convex polyhedra
• Algorithms for Reporting and Counting Geometric Intersections
• Generalization of Voronoi Diagrams in the Plane
• A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: Minimum vertex distance between separable convex polygons