The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
From MaRDI portal
Publication:5317174
DOI10.1137/S0097539702407515zbMath1079.65019OpenAlexW2041935575MaRDI QIDQ5317174
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539702407515
Related Items
On the complexity of barrier resilience for fat regions and bounded ply, Connect the Dot: Computing Feed-Links with Minimum Dilation, A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space, On the union of cylinders in three dimensions, Tangencies between families of disjoint regions in the plane, Decomposition of Multiple Packings with Subquadratic Union Complexity, Approximating the Fréchet distance for realistic curves in near linear time, On realistic terrains, Improved bounds on the union complexity of fat objects, A note on the perimeter of fat objects, Decompositions and boundary coverings of non-convex fat polyhedra, Unnamed Item