Biting: advancing front meets sphere packing

被引：2

作者：

Li, Xiang-Yang ^{[1
]}

Teng, Shang-Hua ^{[1
]}

Üngör, Alper ^{[1
]}

机构：

[1] Department of Computer Science, Univ. Illinois at Urbana-Champaign, Urbana, IL 61801, United States

来源：

| 2000年 / John Wiley & Sons Ltd, Chichester, United Kingdom卷 / 49期

关键词：

Algorithms - Computer simulation - Geometry - Heuristic methods - Optimization - Theorem proving - Trees (mathematics) - Two dimensional;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A key step in the finite element method is to generate a high-quality mesh that is as small as possible for an input domain. Several meshing methods and heuristics have been developed and implemented. Methods based on advancing front, Delaunay triangulations, and quadtrees/octrees are among the most popular ones. Advancing front uses simple data structures and is efficient. Unfortunately, in general, it does not provide any guarantee on the size and quality of the mesh it produces. On the other hand, the circle-packing-based Delaunay methods generate a well-shaped mesh whose size is within a constant factor of the optimal. In this paper, we present a new meshing algorithm, the biting method, which combines the strengths of advancing front and circle packing. We prove that it generates a high-quality 2D mesh, and the size of the mesh is within a constant factor of the optimal.

引用