Discrete & Computational Geometry

, Volume 37, Issue 1, pp 59–77

Inclusion-Exclusion Formulas from Independent Complexes

Authors

    • LIS laboratory, Domaine Universitaire, BP 46, 38402
    • Department of Computer Science, Duke University
Article

DOI: 10.1007/s00454-006-1274-7

Cite this article as:
Attali, D. & Edelsbrunner, H. Discrete Comput Geom (2007) 37: 59. doi:10.1007/s00454-006-1274-7

Abstract

Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We exhibit abstract simplicial complexes that correspond to minimal inclusion-exclusion formulas. They include the dual complex, as defined in [3], and are characterized by the independence of their simplices and by geometric realizations with the same underlying space as the dual complex.

Copyright information

© Springer 2006