Inclusion-exclusion formulas from independent complexes

Discrete and Computational Geometry

Volumn 37, Issue 1, 2007, Pages 59-77

  Attali, Dominique ^a   Edelsbrunner, Herbert ^b,c  

^a Domaine Universitaire   (France)

^b Duke University   (United States)

^c Geomagic   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846798193     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1274-7     Document Type: Article

References (9)

1. F. Aurenhammer. Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Comput. Surv. 23 (1991), 345-405.
2. T. K. Dey and J. Pach. Extremal problems for geometric hypergraphs. Discrete Comput. Geom. 19 (1998), 473-484.
3. H. Edelsbrunner. The union of balls and its dual shape. Discrete Comput. Geom. 13 (1995), 415-440.
4. H. Edelsbrunner and P. Koehl. The geometry of biomolecular solvation. In Combinatorial and Computational Geometry, J. E. Goodman, J. Pach and E. Welzl (eds.), pp. 243-275. MSRI Publ. 52. Cambridge University Press, Cambridge, 2005.
5. I. Gelfand, M. Kapranov, and A. Zelevinsky. Discriminants, Resultants and Multidimensional Determinants. Birkhäuser, Boston, 1994.
6. P. Koehl. ProShape: understanding the shape of protein structures. biogeometry.duke.edu/ software/proshape, 2004.
7. K. Kratky. The area of intersection of n equal circular disks. J. Phys. A 11 (1978), 1017-1024.
8. D. Naiman and H. Wynn. Inclusion-exclusion Bonferroni identities and inequalities for discrete tube-like problems via Euler characteristics. Ann. Statist. 20 (1992), 43-76.
9. G. Perrot, B. Cheng, K. D. Gibson, J. Vila, A. Palmer, A. Nayeem, B. Maigret, and H. A. Scheraga. MSEED: a program for rapid determination of accessible surface areas and their derivatives. J. Comput. Chem. 13 (1992), 1-11.