On the Boundary Complexity of the Union of Fat Triangles

DOI10.1137/S0097539700382169zbMath1018.68086OpenAlexW2155923807MaRDI QIDQ3149892

Gábor Tardos, János Pach

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

zbMATH Keywords

holesfat objectsboundary complexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

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

This page was built for publication: On the Boundary Complexity of the Union of Fat Triangles