The union of balls and its dual shape
- 265 Downloads
Efficient algorithms are described for computing topological, combinatorial, and metric properties of the union of finitely many spherical balls in ℝ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 ℝ3 where unions of finitely many balls are commonly used as models of molecules.
Unable to display preview. Download preview PDF.
- 6.C. J. A. Delfinado and H. Edelsbrunner. An incremental algorithm for betti numbers of simplicial complexes. InProc. 9th Ann. Symp. on Computational Geometry, 1993, pp. 232–239.Google Scholar
- 9.H. Edelsbrunner. Weighted alpha shapes. Report UIUCDCS-R-92-1760, Computer Science Department, University of Illinois, Urbana, IL, 1992.Google Scholar
- 10.H. Edelsbrunner, M. Facello, P. Fu, and J. Liang. Measuring proteins and voids in proteins. InProc. 28th Hawaii Internat. Conf. on System Sciences, 1995, vol. V, pp. 256–264.Google Scholar
- 14.H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations. InProc. 8th Ann. Symp. on Computational Geometry, 1992, pp. 43–52.Google Scholar
- 19.D. Q. Naiman and H. P. Wynn. A topological approach to discriminant analysis.IMS Bull.,19 (1990), 40–41.Google Scholar
- 21.D. Q. Naiman and H. P. Wynn. Abstract tubes and improved inclusion-exclusion identities and inequalities. Manuscript, 1994.Google Scholar