Minimal rectangular partitions of digitized blobs

DOI10.1016/0734-189X(84)90139-7MaRDI QIDQ3735090zbMATH OpenOpenAlexFDO

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

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 processingmatchingmaximum number of independent vertices in a bipartite graphpartition algorithmpartitioning a finite region of the digital plane into a minimum number of rectangular regions

Mathematics Subject Classification ID

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

Recommendations

• On heuristics for minimum length rectilinear partitions
• Max-min partitioning of grid graphs into connected components
• Minimum k-partitioning of rectilinear polygons
• Minimum k-adjacent rectangles of orthogonal polygons and its application
• scientific article; zbMATH DE number 4062592

Cited in

(20)

• Partitioning and separating sets of orthogonal polygons
• Finding a minimal cover for binary images: An optimal parallel algorithm
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• On convex partitions of polygonal regions
• Morphological decomposition and compression of binary images via a minimum set cover algorithm
• Finding a largest rectangle inside a digital object and rectangularization
• Towards an algorithmic guide to Spiral Galaxies
• Approximation algorithms for decomposing octilinear polygons
• Rectangular partitions of a rectilinear polygon
• Minimum k-adjacent rectangles of orthogonal polygons and its application
• An algorithm for computing the number of the minimal paths in digital images
• scientific article; zbMATH DE number 2084490 (Why is no real title available?)
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
• Cartesian product partitioning of multi-dimensional reachable state spaces
• Optimal matrix-segmentation by rectangles
• Rectangularization of digital objects and its relation with straight skeletons
• Orthogonal dissection into few rectangles
• Computation of 2D continuous geometric moments through inclusion-exclusion
• Minimum k-partitioning of rectilinear polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735090)