On the complexity of the union of fat convex objects in the plane

DOI10.1007/PL00009494zbMath0944.68183OpenAlexW1991938436MaRDI QIDQ1971503

Micha Sharir, Alon Efrat

Publication date: 23 March 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009494

zbMATH Keywords

combinatorial complexity

Mathematics Subject Classification ID

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

Related Items

Approximate unions of lines and Minkowski sums, Exact and approximation algorithms for computing optimal fat decompositions, On the union of cylinders in three dimensions, Decomposition of Multiple Packings with Subquadratic Union Complexity, The number of holes in the union of translates of a convex set in three dimensions, On the number of regular vertices of the union of Jordan regions, Placing Text Boxes on Graphs, Domination in Geometric Intersection Graphs, Dynamic data structures for fat objects and their applications