Pages that link to "Item:Q3991698"
From MaRDI portal
The following pages link to A linear time algorithm for the computation of some distance functions between convex polygons (Q3991698):
Displaying 15 items.
- An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing (Q878095) (← links)
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Recognizing the similarity of polygons in a strengthened Hausdorff metric (Q2263300) (← links)
- Conflating two polygonal lines (Q2369551) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- A general algorithm for computing distance transforms in linear time (Q2759989) (← links)
- A linear algorithm for determining the separation of convex polyhedra (Q3697818) (← links)
- (Q4226562) (← links)
- (Q4949360) (← links)
- (Q4949363) (← links)
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS (Q5125208) (← links)
- (Q5224252) (← links)
- (Q5314313) (← links)