Isosurface stuffing: Fast tetrahedral meshes with good dihedral angles

ACM Transactions on Graphics

Volumn 26, Issue 3, 2007, Pages

  Labelle, François ^a   Shewchuk, Jonathan Richard ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dihedral angle; Isosurface; Tetrahedral mesh generation

Indexed keywords

DIHEDRAL ANGLES; ISOSURFACSES; TETRAHEDRAL MESH GENERATION;

ANGLE MEASUREMENT; FEATURE EXTRACTION; FINITE ELEMENT METHOD; NUMERICAL METHODS; PARAMETER ESTIMATION;

ALGORITHMS;

EID: 34547668717     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/1276377.1276448     Document Type: Article

References (34)

1. ALLIEZ, P., COHEN-STEINER, D., YVINEC, M., AND DESBRUN, M. 2005. Variational Tetrahedral Meshing. ACM Transactions on Graphics 24, 3, 617-625. Special issue on Proceedings of SIGGRAPH 2005.
2. AMENTA, N., AND BERN, M. 1999. Surface Reconstruction by Voronoi Filtering. Discrete & Computational Geometry 22, 4 (Dec.), 481-504.
3. AMENTA, N., CHOI, S., DEY, T. K., AND LEEKHA, N. 2002. A Simple Algorithm for Homeomorphic Surface Reconstruction. International Journal of Computational Geometry and Applications 12, 1-2, 125-141.
4. BÆRENTZEN, J. A., AND AANÆS, H. 2002. Generating Signed Distance Fields from Triangle Meshes. Tech. Rep. IMM-TR-2002-21, Informatics and Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
5. BAKER, B. S., GROSSE, E., AND RAFFERTY, C S. 1988. Nonobtuse Triangulation of Polygons. Discrete and Computational Geometry 3, 2, 147-168.
6. BANK, R. E., AND SCOTT, L. R. 1989. On the Conditioning of Finite Element Equations with Highly Refined Meshes. SIAM Journal on Numerical Analysis 26, 6 (Dec.), 1383-1394.
7. BERN, M., EPPSTEIN, D., AND GILBERT, J. R. 1994. Provably Good Mesh Generation. Journal of Computer and System Sciences 48, 3 (June), 384-409.
8. BEY, J. 1995. Tetrahedral Grid Refinement. Computing 55, 355-378.
9. BLOOMENTHAL, J. 1994. An Implicit Surface Polygonizer. In Graphics Gems IV. Academic Press, ch. IV.8, 324-349.
10. CHENG, S.-W., AND DEY, T. K. 2002. Quality Meshing with Weighted Delaunay Refinement. In Proceedings of the Thirteenth Annual Symposium on Discrete Algorithms, 137-146.
11. CHENG, S.-W., DEY, T. K., EDELSBRUNNER, H., FACELLO, M. A., AND TENG, S.-H. 2000. Sliver Exudation. Journal of the ACM 47, 5 (Sept.), 883-904.
12. CHEW, L. P. 1989. Guaranteed-Quality Triangular Meshes. Tech. Rep. TR-89-983, Department of Computer Science, Cornell. University.
13. CHEW, L. P. 1997. Guaranteed-Quality Delaunay Meshing in 3D. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 391-393.
14. EDELSBRUNNER, H., AND GUOY, D. 2001. An Experimental Study of Sliver Exudation. In Tenth International Meshing Roundtable, 301-316.
15. EPPSTEIN, D., SULLIVAN, J. M., AND ÜNGÖR, A. 2004. Tiling Space and Slabs with Acute Tetrahedra. Computational Geometry: Theory and Applications 27, 3 (Mar.), 237-255.
16. FREITAG, L. A., AND OLLIVIER-GOOCH, C 1997. Tetrahedral Mesh Improvement Using Swapping and Smoothing. International Journal for Numerical Methods in Engineering 40, 21 (Nov.), 3979-4002.
17. FUCHS, A. 1998. Automatic Grid Generation with Almost Regular Delaunay Tetrahedra. In Seventh International Meshing Roundtable, 133-148.
18. JAMET, P. 1976. Estimations d'Erreur pour des Élements Finis Droits Presque Dégénérés. RAIRO Analyse Numérique 10, 43-61.
19. KŘÍŽEK, M. 1992. On the Maximum Angle Condition for Linear Tetrahedral Elements. SIAM Journal on Numerical Analysis 29, 2 (Apr.), 513-520.
20. LABELLE, F. 2006. Sliver Removal by Lattice Refinement. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, 347-356.
21. LI, X.-Y., AND TENG, S.-H. 2001. Generating Well-Shaped Delaunay Meshes in 3D. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 28-37.
22. LORENSEN, W. E., AND CLINE, H. E. 1987. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. In Computer Graphics (SIGGRAPH '87 Proceedings), 163-170.
23. MITCHELL, S. A., AND VAVASIS, S. A. 2000. Quality Mesh Generation in Higher Dimensions. SIAM Journal on Computing 29, 4, 1334-1310.
24. MOLINO, N., BRIDSON, R., TERAN, J., AND FEDKIW, R. 2003. A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra. In Twelfth International Meshing Roundtable, 103-114.
25. NAYLOR, D.J. 1999. Filling Space with Tetrahedra. International Journal for Numerical Methods in Engineering 44, 10 (Apr.), 1383-1395.
26. OHTAKE, Y., BELYAEV, A., ALEXA, M., TURK, G., AND SEIDEL, H.-P. 2003. Multi-Level Partition of Unity Implicits. ACM Transactions on Graphics 22, 3 (July), 463-470. Special issue on Proceedings of SIGGRAPH 2003.
27. OSHER, S., AND FEDKIW, R. 2002. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag, New York.
28. OUDOT, S., RINEAU, L., AND YVINEC, M. 2005. Meshing Volumes Bounded by Smooth Surfaces. In Proceedings of the 14th International Meshing Roundtable, 203-219.
29. SETHIAN, J. A. 1996. A Fast Marching Level Set Method for Monotonically Advancing Fronts. Proceedings of the National Academy of Sciences 93, 4 (Feb.), 1591-1595.
30. SHEN, C., O'BRIEN, J. F., AND SHEWCHUK, J. R. 2004. Interpolating and Approximating Implicit Surfaces from Polygon Soup. ACM Transactions on Graphics 23, 3 (Aug.), 896-904. Special issue on Proceedings of SIGGRAPH 2004.
31. SHEWCHUK, J. R. 2002. What Is a Good Linear Element? Interpolation, Conditioning, and Quality Measures. In Eleventh International Meshing Roundtable, 115-126.
32. SOMMERVILLE, D. M. Y. 1923. Space-Filling Tetrahedra in Euclidean Space. Proceedings of the Edinburgh Mathematical Society 41, 49-57.
33. YERRY, M. A., AND SHEPHARD, M. S. 1984. Automatic Three-Dimensional Mesh Generation by the Modified-Octree Technique. International Journal for Numerical Methods in Engineering 20, 11 (Nov.), 1965-1990.
34. ZHAO, H.-K., OSHER, S., AND FEDKIW, R. 2001. Fast Surface Reconstruction Using the Level Set Method. In Workshop on Variational and Level Set Methods, 194-202.