Pages that link to "Item:Q786507"
From MaRDI portal
The following pages link to An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507):
Displaying 14 items.
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- Object and image indexing based on region connection calculus and oriented matroid theory (Q1775631) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
