Pages that link to "Item:Q1196367"
From MaRDI portal
The following pages link to Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367):
Displaying 11 items.
- On convex partitions of polygonal regions (Q1296981) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- Minimum stabbing rectangular partitions of rectilinear polygons (Q1652208) (← links)
- Extracting compact fuzzy rules based on adaptive data approximation using B-splines (Q1857071) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX (Q3084688) (← links)
- MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN (Q4682201) (← links)
- CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES (Q5358087) (← links)
- Optimal matrix-segmentation by rectangles (Q5902115) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)
