The following pages link to (Q3786288):
Displaying 16 items.
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← 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)
- Storing line segments in partition trees (Q911289) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- On decomposing polygons into uniformly monotone parts (Q1108793) (← 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)
- Partitioning linear spaces into complete quadrilaterals and \(n\)-gons (Q1339778) (← links)
- On \(d\)-convex partitions of polygonal regions (Q2731381) (← links)
- (Q3200146) (← links)
- (Q3796750) (← links)
- (Q4530827) (← links)
- Linear-time heuristics for minimum weight rectangulation (Q5054819) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901274) (← links)