Finding the largest area rectangle of arbitrary orientation in a closed contour
From MaRDI portal
Recommendations
Cites work
- Computing a maximum axis-aligned rectangle in a convex polygon
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Fareys series and Pick's area theorem
- Finding the largest area axis-parallel rectangle in a polygon
- Fractal-based brain tumor detection in multimodal MRI
- Incorporating domain knowledge into medical image clustering
- Largest inscribed rectangles in convex polygons
Cited in
(10)- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Finding a largest rectangle inside a digital object and rectangularization
- scientific article; zbMATH DE number 4033105 (Why is no real title available?)
- An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- Largest area parallelogram inside a digital object in a triangular grid
- Largest unit rectangles inscribed in a convex polygon
- Parametric algorithm to find the largest empty rectangle from a set of line segments
- An efficient finite element solution using a large pre-solved regular element
- A simple method for fitting of bounding rectangle to closed regions
This page was built for publication: Finding the largest area rectangle of arbitrary orientation in a closed contour
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440979)