|
Biting: Advancing Front Meets Sphere PackingLi, Xiang-Yang, Shang-Hua Teng and Alper Ungor2nd Symposium on Trends in Unstructured Mesh Generation, University of Colorado, Boulder, August 1999
|
|
2nd Symposium on
Trends in Unstructured Mesh Generation 5th US Congress on Computational Mechanics University of Colorado, Boulder August 4-6, 1999
Department of Computer Science, University of Illinois at Urbana-
Champaign, Urbana, IL 61801
Abstract In this paper, we show that the advancing front method can be used to efficiently construct a quality sphere-packing. At a high level, this new advancing front based packing algorithm first finds a sphere packing of the boundary of the domain and then grows the packing towards the interior of the domain. Each time when a new sphere is added to the interior, a larger protection sphere is removed (bitten away) from the domain so that no future sphere will overlap with this one. By doing this, it builds the sphere packing by adding spheres one at a time, or a layer at a time, in the same spirit as the standard advancing method; our new method uses advancing front to construct a sphere packing instead of the mesh elements themselves. We show that this advancing front based method does generate a well-spaced point set, whose Delaunay triangulation is well-shaped. We will refer this new method as the biting method and show that it can be made as practical as the standard advancing front meshing methods. Biting sphere at a point x is B(x, c Contact author(s) or publisher for availability and copyright information on above referenced article |