Largest placement of one convex polygon inside another
From MaRDI portal
(Redirected from Publication:1380791)
Recommendations
- Largest inscribed rectangles in convex polygons
- Optimal placement of convex polygons to maximize point containment
- scientific article; zbMATH DE number 871906
- Finding largest rectangles in convex polygons
- scientific article; zbMATH DE number 522850
- The maximum size of a convex polygon in a restricted set of points in the plane
- Largest polygons with vertices in a given finite set
- Largest triangles in a polygon
- A note on the size of the largest ball inside a convex polytope
- On convex polygons of maximal width
Cited in
(18)- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- Rotational polygon overlap minimization and compaction
- Isometric and affine copies of a set in volumetric Helly results
- Largest triangles in a polygon
- The reverse Kakeya problem
- scientific article; zbMATH DE number 1766719 (Why is no real title available?)
- The reverse Kakeya problem
- Computing maximal copies of polyhedra contained in a polyhedron
- An algorithmic approach to Rupert’s problem
- Optimizing for the Rupert Property
- Largest area parallelogram inside a digital object in a triangular grid
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- Fat triangles inscribed in arbitrary planar domains
- Largest similar copies of convex polygons in polygonal domains
- Convex polygon containment: improving quadratic to near linear time
- Some New Insights from Highly Optimized Polyhedral Passages
- Smallest universal covers for families of triangles
- Maximum-area and maximum-perimeter rectangles in polygons
This page was built for publication: Largest placement of one convex polygon inside another
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380791)
