Pages that link to "Item:Q1330463"
From MaRDI portal
The following pages link to Extremal polygon containment problems (Q1330463):
Displaying 19 items.
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- Rotational polygon containment and minimum enclosure using only robust 2D constructions (Q1305861) (← links)
- Approximation of convex figures by pairs of rectangles (Q1388135) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- The containment problem and a rational simplicial arrangement (Q1757295) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment (Q1923770) (← links)
- Largest triangles in a polygon (Q2230417) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Containment problems for polytopes and spectrahedra (Q2848183) (← links)
- (Q3197871) (← links)
- Finding Extremal Polygons (Q3221405) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- Matching convex polygons and polyhedra, allowing for occlusion (Q6560226) (← links)