On the union complexity of diametral disks

zbMath1295.52028MaRDI QIDQ396766

Rom Pinchasi, Boris Aronov, Micha Sharir, Muriel Dulieu

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p53

zbMATH Keywords

Gabriel graphdiametral circlesunion complexity

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45)

Related Items (1)

On the union complexity of families of axis-parallel rectangles with a low packing number

Cites Work

• Unnamed Item
• Witness Gabriel graphs
• Degrees of nonlinearity in forbidden 0-1 matrix problems
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The maximum number of unit distances in a convex \(n\)-gon
• On a problem of K. Zarankiewicz

This page was built for publication: On the union complexity of diametral disks