Pages that link to "Item:Q1384209"
From MaRDI portal
The following pages link to On fat partitioning, fat covering and the union size of polygons (Q1384209):
Displaying 15 items.
- Unions of fat convex polytopes have short skeletons (Q443910) (← links)
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← links)
- Generalized disk graphs (Q832849) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- On realistic terrains (Q934023) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- On the flatness of Minkowski sums (Q1847384) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Placing Text Boxes on Graphs (Q3611861) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q5060136) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)