Finding the largest area rectangle of arbitrary orientation in a closed contour
From MaRDI portal
Publication:440979
DOI10.1016/J.AMC.2012.03.063zbMATH Open1245.65025OpenAlexW1982636475WikidataQ62044080 ScholiaQ62044080MaRDI QIDQ440979FDOQ440979
Authors: Rubén Molano, Pablo G. Rodríguez, Andrés Caro, M. Luisa Durán 
Publication date: 19 August 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.03.063
Recommendations
Cites Work
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Largest inscribed rectangles in convex polygons
- Finding the largest area axis-parallel rectangle in a polygon
- Incorporating domain knowledge into medical image clustering
- Fractal-based brain tumor detection in multimodal MRI
- Computing a maximum axis-aligned rectangle in a convex polygon
- Fareys series and Pick's area theorem
Cited In (8)
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding a largest rectangle inside a digital object and rectangularization
- A simple method for fitting of bounding rectangle to closed regions
- Largest area parallelogram inside a digital object in a triangular grid
- An efficient finite element solution using a large pre-solved regular element
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
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)
