An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
From MaRDI portal
(Redirected from Publication:786507)
Cites work
- A new linear algorithm for intersecting convex polygons
- A note on the all nearest-neighbor problem for convex polygons
- Computing the extreme distances between two convex polygons
- Finding the minimum vertex distance between two disjoint convex polygons in linear time
- Optimal algorithms for computing the minimum distance between two finite planar sets
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- The all nearest-neighbor problem for convex polygons
Cited in
(14)- Object and image indexing based on region connection calculus and oriented matroid theory
- Translating a convex polygon to contain a maximum number of points.
- New variants of perfect non-crossing matchings
- Finding a closet visible vertex pair between two polygons
- Finding the minimum vertex distance between two disjoint convex polygons in linear time
- Extremal point queries with lines and line segments and related problems
- A simple linear algorithm for intersecting convex polygons
- Optimal placement of convex polygons to maximize point containment
- On determining the on-line minimax linear fit to a discrete point set in the plane
- Polygonal path simplification with angle constraints
- New variants of perfect non-crossing matchings
- Polygonal chain approximation: A query based approach
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Triangulations, visibility graph and reflex vertices of a simple polygon
This page was built for publication: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786507)
