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.
Discrete & Computational Geometry
This work is supported by the National Science Foundation, under Grant ASC-9200301, and the Alan T. Waterman award, Grant CCR-9118874. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the view of the National Science Foundation.
415 - 440
Edelsbrunner H. The union of balls and its dual shape. Discrete & Computational Geometry. 1995;13(1):415-440. doi:10.1007/BF02574053
Edelsbrunner, H. (1995). The union of balls and its dual shape. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02574053
Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.” Discrete & Computational Geometry. Springer, 1995. https://doi.org/10.1007/BF02574053.
H. Edelsbrunner, “The union of balls and its dual shape,” Discrete & Computational Geometry, vol. 13, no. 1. Springer, pp. 415–440, 1995.
Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete & Computational Geometry. 13(1), 415–440.
Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.” Discrete & Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 415–40, doi:10.1007/BF02574053.
All files available under the following license(s):
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)