On the Boundary Complexity of the Union of Fat Triangles
From MaRDI portal
Publication:3149892
DOI10.1137/S0097539700382169zbMath1018.68086OpenAlexW2155923807MaRDI QIDQ3149892
Publication date: 29 September 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539700382169
Related Items
Approximate unions of lines and Minkowski sums, On the union of cylinders in three dimensions, Near-linear approximation algorithms for geometric hitting sets, Unions of fat convex polytopes have short skeletons, Improved bounds on the union complexity of fat objects, The number of holes in the union of translates of a convex set in three dimensions, Computing the visibility map of fat objects