The Complexity of the Union of (\alpha,\beta)-Covered Objects
From MaRDI portal
(Redirected from The Complexity of the Union of (\alpha,\beta)-Covered Objects)
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
Recommendations
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Improved bounds on the union complexity of fat objects
- On the complexity of the union of fat convex objects in the plane
- Improved bounds for the union of locally fat objects in the plane
- Better bounds on the union complexity of locally fat objects
Cited in
(17)- Decompositions and boundary coverings of non-convex fat polyhedra
- On the complexity of barrier resilience for fat regions and bounded ply
- On the union of \(\kappa\)-curved objects
- On the complexity of the union of fat convex objects in the plane
- Connect the Dot: Computing Feed-Links with Minimum Dilation
- A note about weak -nets for axis-parallel boxes in d-space
- Tangencies between families of disjoint regions in the plane
- Approximating the Fréchet distance for realistic curves in near linear time
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- Better bounds on the union complexity of locally fat objects
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On the union of cylinders in three dimensions
- Robustly guarding polygons
- A note on the perimeter of fat objects
- On realistic terrains
- Improved bounds on the union complexity of fat objects
This page was built for publication: The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317174)
