The following pages link to (Q3893361):
Displaying 15 items.
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- A unified approach to layout wirability (Q3754571) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- Orthogonal dissection into few rectangles (Q6662769) (← links)
