Finding a largest rectangle inside a digital object and rectangularization

DOI10.1016/j.jcss.2017.05.006zbMath1390.68728OpenAlexW2617140191MaRDI QIDQ1747507

Apurba Sarkar, Arnab Bhattacharya, Arindam Biswas, Mousumi Dutt

Publication date: 8 May 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.05.006

zbMATH Keywords

rectangleshape analysisdigital objectinner isothetic coverisothetic gridrectangularizationshape signatures

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest, Largest area parallelogram inside a digital object in a triangular grid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the largest area rectangle of arbitrary orientation in a closed contour
• Finding the largest area axis-parallel rectangle in a polygon
• On the maximum empty rectangle problem
• A polynomial solution for the Potato-peeling problem
• Minimal rectangular partitions of digitized blobs
• Computing the Largest Empty Rectangle
• On Computing a Largest Empty Arbitrarily Oriented Rectangle
• Computational Science and Its Applications – ICCSA 2004