Browse > Article

Octree-Based Adaptive Tetrahedral Meshing  

Kim, Chul-Won (Kwangwoon University)
Park, Suk-Hoon (Kwangwoon University)
Choi, Min-Gyu (Kwangwoon University)
Publication Information
Journal of the Korea Computer Graphics Society / v.17, no.2, 2011 , pp. 45-53 More about this Journal
Abstract
This paper proposes a volume meshing method that fills the inside of an object with tetrahedra, of which dihedral angles are good. The suggested method is fast, stable and easy to implement It can also utilize an octree structure to space-efficiently fill an object with graded tetrahedra by reducing the total number of tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree such that any pair of neighboring cells only differs by one level. To efficiently construct a restricted-octree and generate a volume mesh from the octree, we utilize a signed distance field of an object on its bounded workspace. The suggested method can be employed in FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow.
Keywords
volume meshing; tetrahedral mesh; octree; signed distance field;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Thurmer and C. Wuthrich, "Computing vertex normals from polygonal facets," Journal of Graphics Tools, vol. 3, no. 1, pp.43-46, 1998.   DOI
2 J. A. Sethian, "A fast marching level set method for monotonically advancing fronts," in Proc. National Academy of Sciences, vol. 93, no. 4, 1996, pp. 1591-1595.   DOI   ScienceOn
3 F. Labelle, "Sliver removal by lattice refinement," in Proc. Twenty-Second Annual Symposium on Computational Geometry, 2006, pp. 347-356.
4 L. P. Chew, "Guaranteed-quality triangular meshes," Department of Computer Science, Cornell University, Tech. Rep. TR-89-983,1989.
5 M. Bern, D. Eppstein, and J. R. Gilbert, "Probably good mesh generation," Journal of Computer and System Sciences, vol. 48, no. 3,pp.384-409, 1994.   DOI   ScienceOn
6 C. H. Sequin, "Procedural spline interpolation in unicubix,' in Proc. Third USENIX Computer Graphics Workshop, 1986, pp.63-83.
7 F. Labelle and J. R. Shewchuk, "Isosurface stuffing: Fast tetrahedral meshes with good dihedral angles," ACM Transactions on Graphics (Proc. SIGGRAPH 2007), vol. 26, no. 3, p. 57, 2007.
8 J. Brerentzen and H. Aaenas, "Generating signed distance fields from triangle meshes," Information and Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, Tech. Rep. IMM-TR-2002-21, 2002.
9 S.-W. Cheng and T. K. Dey, "Quality meshing with weighted delaunay refinement," in Proc. Thirteenth Annual Symposium on Discrete Algorithms, 2002, pp. 137-146.
10 S, A. Mitchell and S. A. Vavasis, "Quality mesh generation in higher dimensions," SIAM Journal on Computing, vol. 29, no. 4, pp. 1334-1370, 2000.   DOI   ScienceOn
11 B. S. Baker, E. Grosse, and C. S. Rafferty, "Nonobtuse triangulation of polygons," Discrete and Computational Geometry, vol. 3, no. 2, pp. 147-168, 1998.
12 S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng, "Sliver exudation," Journal of the ACM, vol. 47, no. 5,pp. 883-904, 2000.   DOI   ScienceOn
13 L. P. Chew, "Guaranteed-quality delaunay meshing in 3D," in Proc. Thirteenth Annual Symposium on Computational Geometry, 1997, pp. 391-393.
14 X.-Y. Li and S.-H. Teng, "Generating well-shaped delaunay meshes in 3D," in Proc. Twelfth Annual Symposium on Discrete Algorithms, 2001, pp. 28-37.