Pages that link to "Item:Q3735090"
From MaRDI portal
The following pages link to Minimal rectangular partitions of digitized blobs (Q3735090):
Displayed 15 items.
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- On convex partitions of polygonal regions (Q1296981) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Rectangular partitions of a rectilinear polygon (Q2678268) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN (Q4682201) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES (Q5358087) (← links)
- Optimal matrix-segmentation by rectangles (Q5902115) (← links)