Finding a largest rectangle inside a digital object and rectangularization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3883624 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 4213497 (Why is no real title available?)
- scientific article; zbMATH DE number 4149525 (Why is no real title available?)
- scientific article; zbMATH DE number 3907805 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A polynomial solution for the Potato-peeling problem
- Computational Science and Its Applications – ICCSA 2004
- Computing the Largest Empty Rectangle
- Finding the largest area axis-parallel rectangle in a polygon
- Finding the largest area rectangle of arbitrary orientation in a closed contour
- Minimal rectangular partitions of digitized blobs
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- On the maximum empty rectangle problem
Cited in
(4)- scientific article; zbMATH DE number 4033105 (Why is no real title available?)
- Rectangularization of digital objects and its relation with straight skeletons
- Largest area parallelogram inside a digital object in a triangular grid
- 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 a largest rectangle inside a digital object and rectangularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747507)