The union of balls and its dual shape

  • Authors:
  • Herbert Edelsbrunner

  • Affiliations:
  • -

  • Venue:
  • SCG '93 Proceedings of the ninth annual symposium on Computational geometry
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Efficient algorithms are described for computing topological,combinatorial, and metric properties of the union of finitely many ballsin Rd. These algorithms are based on a simplicial complexdual to a certain decomposition of the union of balls, and on shortinclusion-exclusion formulas derived from this complex. The algorithmsare most relevant in R3 where unions of finitely many balls arecommonly used as models of molecules.