The following pages link to (Q4763391):
Displaying 15 items.
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Minimum width color spanning annulus (Q1748988) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- An optimal algorithm for roundness determination on convex polygons (Q1917034) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- Approximate matching of polygonal shapes (Q1924770) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)
