---
res:
  bibo_abstract:
  - Efficient algorithms are described for computing topological, combinatorial, and
    metric properties of the union of finitely many spherical balls in R(d) These
    algorithms are based on a simplicial complex dual to a decomposition of the union
    of balls using Voronoi cells, and on short inclusion-exclusion formulas derived
    from this complex. The algorithms are most relevant in R(3) where unions of finitely
    many balls are commonly used as models of molecules.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Herbert
      foaf_name: Edelsbrunner, Herbert
      foaf_surname: Edelsbrunner
      foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9823-6833
  bibo_doi: 10.1007/BF02574053
  bibo_issue: '1'
  bibo_volume: 13
  dct_date: 1995^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0179-5376
  dct_language: eng
  dct_publisher: Springer@
  dct_title: The union of balls and its dual shape@
...