On determining the cover of a simplex by spheres centered at its vertices
- 334 Downloads
The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.
KeywordsCovering Simplex Spheres
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- 3.Edelsbrunner, H.: The union of balls and its dual shape. In: SCG’93: Proceedings of the Ninth Annual Symposium on Computational Geometry, pp. 218–231, ACM, New York, USA (1993)Google Scholar
- 6.Sadri, B.: Surface and medial axis topology through distance flows induced by discrete samples. PhD thesis, University of Illinois, Urbana, Illinois (2006). http://www.cs.duke.edu/~sadri