An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
From MaRDI portal
Publication:786507
DOI10.1007/BF02243778zbMath0528.65005OpenAlexW1507258608MaRDI QIDQ786507
Publication date: 1984
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243778
Related Items (14)
New variants of perfect non-crossing matchings ⋮ On determining the on-line minimax linear fit to a discrete point set in the plane ⋮ Finding a closet visible vertex pair between two polygons ⋮ Triangulations, visibility graph and reflex vertices of a simple polygon ⋮ New variants of perfect non-crossing matchings ⋮ Translating a convex polygon to contain a maximum number of points. ⋮ Polygonal chain approximation: A query based approach ⋮ Object and image indexing based on region connection calculus and oriented matroid theory ⋮ Optimal placement of convex polygons to maximize point containment ⋮ A simple linear algorithm for intersecting convex polygons ⋮ Polygonal path simplification with angle constraints ⋮ Extremal point queries with lines and line segments and related problems ⋮ Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set ⋮ Finding the minimum vertex distance between two disjoint convex polygons in linear time
Cites Work
- Finding the minimum vertex distance between two disjoint convex polygons in linear time
- The all nearest-neighbor problem for convex polygons
- A note on the all nearest-neighbor problem for convex polygons
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Optimal algorithms for computing the minimum distance between two finite planar sets
- A new linear algorithm for intersecting convex polygons
- Computing the extreme distances between two convex polygons
This page was built for publication: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
