On the complexity of the union of fat convex objects in the plane
From MaRDI portal
Recommendations
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Improved bounds on the union complexity of fat objects
- Improved bounds for the union of locally fat objects in the plane
- Better bounds on the union complexity of locally fat objects
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
Cited in
(22)- Placing Text Boxes on Graphs
- On the union of fat tetrahedra in three dimensions
- On the union of \(\kappa\)-round objects
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- On the number of regular vertices of the union of Jordan regions
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Dynamic data structures for fat objects and their applications
- Improved bounds on the union complexity of fat objects
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- Unions of fat convex polytopes have short skeletons
- Exact and approximation algorithms for computing optimal fat decompositions
- On the union of cylinders in three dimensions
- Improved bound for the union of fat triangles
- Approximate unions of lines and Minkowski sums
- State of the union (of geometric objects)
- scientific article; zbMATH DE number 1786523 (Why is no real title available?)
- Better bounds on the union complexity of locally fat objects
- On fat partitioning, fat covering and the union size of polygons
- Domination in Geometric Intersection Graphs
- Improved bounds for the union of locally fat objects in the plane
- The number of holes in the union of translates of a convex set in three dimensions
This page was built for publication: On the complexity of the union of fat convex objects in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971503)
