Minimal rectangular partitions of digitized blobs

DOI10.1016/0734-189X(84)90139-7zbMath0599.68051OpenAlexW2039562882MaRDI QIDQ3735090

P. V. Sankar, Jack Sklansky, Leonard Anthony Ferrari

Publication date: 1984

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(84)90139-7

zbMATH Keywords

image processingmatchingpartition algorithmmaximum number of independent vertices in a bipartite graphpartitioning a finite region of the digital plane into a minimum number of rectangular regions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (15)

Partitioning and separating sets of orthogonal polygons ⋮ Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application ⋮ Rectangular partitions of a rectilinear polygon ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES ⋮ Minimum k-partitioning of rectilinear polygons ⋮ Morphological decomposition and compression of binary images via a minimum set cover algorithm ⋮ Finding a minimal cover for binary images: An optimal parallel algorithm ⋮ Finding a largest rectangle inside a digital object and rectangularization ⋮ Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles ⋮ Optimal matrix-segmentation by rectangles ⋮ MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN ⋮ Close-to-optimal algorithm for rectangular decomposition of 3D shapes ⋮ On convex partitions of polygonal regions ⋮ Towards an algorithmic guide to Spiral Galaxies

This page was built for publication: Minimal rectangular partitions of digitized blobs