The union of congruent cubes in three dimensions

J. Pach*, I. Safruti, M. Sharir

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

A dihedral (trihedral) wedge is the intersection of two (resp. three) half-spaces in R3. It is called α-fat if the angle (resp., solid angle) determined by these half-spaces is at least α > 0. If, in addition, the sum of the three face angles of a trihedral wedge is at least γ > 4π/3, then it is called (γ, α)-substantially fat. We prove that, for any fixed γ > 4π/3, α > 0, the combinatorial complexity of the union of n (a) α-fat dihedral wedges, (b) (γ, α)-substantially fat trihedral wedges is at most O(n2+ε), for any ε > 0, where the constants of proportionality depend on ε, α (and γ). We obtain as a corollary that the same upper bound holds for the combinatorial complexity of the union of n (nearly) congruent cubes in R3. These bounds are not far from being optimal.

Original languageEnglish
Pages19-28
Number of pages10
DOIs
StatePublished - 2001
Externally publishedYes
Event17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States
Duration: 3 Jun 20015 Jun 2001

Conference

Conference17th Annual Symposium on Computational Geometry (SCG'01)
Country/TerritoryUnited States
CityMedford, MA
Period3/06/015/06/01

Fingerprint

Dive into the research topics of 'The union of congruent cubes in three dimensions'. Together they form a unique fingerprint.

Cite this