{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T22:27:45Z","timestamp":1785536865164,"version":"3.56.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2007,7,29]]},"abstract":"<jats:p>\n            The\n            <jats:italic>isosurface stuffing<\/jats:italic>\n            algorithm fills an isosurface with a uniformly sized tetrahedral mesh whose dihedral angles are bounded between 10.7\u00b0 and 164.8\u00b0, or (with a change in parameters) between 8.9\u00b0 and 158.8\u00b0. The algorithm is whip fast, numerically robust, and easy to implement because, like Marching Cubes, it generates tetrahedra from a small set of precomputed stencils. A variant of the algorithm creates a mesh with internal grading: on the boundary, where high resolution is generally desired, the elements are fine and uniformly sized, and in the interior they may be coarser and vary in size. This combination of features makes isosurface stuffing a powerful tool for dynamic fluid simulation, large-deformation mechanics, and applications that require interactive remeshing or use objects defined by smooth implicit surfaces. It is the first algorithm that rigorously guarantees the suitability of tetrahedra for finite element methods in domains whose shapes are substantially more challenging than boxes. Our angle bounds are guaranteed by a computer-assisted proof. If the isosurface is a smooth 2-manifold with bounded curvature, and the tetrahedra are sufficiently small, then the boundary of the mesh is guaranteed to be a geometrically and topologically accurate approximation of the isosurface.\n          <\/jats:p>","DOI":"10.1145\/1276377.1276448","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":172,"title":["Isosurface stuffing"],"prefix":"10.1145","volume":"26","author":[{"given":"Fran\u00e7ois","family":"Labelle","sequence":"first","affiliation":[{"name":"University of California at Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan Richard","family":"Shewchuk","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073238"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Amenta N. and Bern M. 1999. Surface Reconstruction by Voronoi Filtering. Discrete &amp; Computational Geometry 22 4 (Dec.) 481--504.  Amenta N. and Bern M. 1999. Surface Reconstruction by Voronoi Filtering. Discrete &amp; Computational Geometry 22 4 (Dec.) 481--504.","DOI":"10.1007\/PL00009475"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000773"},{"key":"e_1_2_2_4_1","volume-title":"Tech. Rep. IMM-TR-2002-21, Informatics and Mathematical Modelling","author":"B\u00e6rentzen J. A.","year":"2002","unstructured":"B\u00e6rentzen , J. A. , and Aan\u00e6s , 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 . B\u00e6rentzen, J. A., and Aan\u00e6s, 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."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187904"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0726080"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80059-5"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238487"},{"key":"e_1_2_2_9_1","volume-title":"An Implicit Surface Polygonizer","author":"Bloomenthal J.","unstructured":"Bloomenthal , J. 1994. An Implicit Surface Polygonizer . In Graphics Gems IV. Academic Press , ch. IV.8. 324--349. Bloomenthal, J. 1994. An Implicit Surface Polygonizer. In Graphics Gems IV. Academic Press, ch. IV.8. 324--349."},{"key":"e_1_2_2_10_1","volume-title":"Proceedings of the Thirteenth Annual Symposium on Discrete Algorithms, 137--146","author":"Cheng S.-W.","unstructured":"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 . 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."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/355483.355487"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/262839.263018"},{"key":"e_1_2_2_14_1","unstructured":"Edelsbrunner H. and Guoy D. 2001. An Experimental Study of Sliver Exudation. In Tenth International Meshing Roundtable 307--316.  Edelsbrunner H. and Guoy D. 2001. An Experimental Study of Sliver Exudation. In Tenth International Meshing Roundtable 307--316."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2003.11.003"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19971115)40:21<3979::AID-NME251>3.0.CO;2-9"},{"key":"e_1_2_2_17_1","unstructured":"Fuchs A. 1998. Automatic Grid Generation with Almost Regular Delaunay Tetrahedra. In Seventh International Meshing Roundtable 133--148.  Fuchs A. 1998. Automatic Grid Generation with Almost Regular Delaunay Tetrahedra. In Seventh International Meshing Roundtable 133--148."},{"key":"e_1_2_2_18_1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/m2an\/197610R100431","article-title":"Estimations d'Erreur pour des \u00c9lements Finis Droits Presque D\u00e9g\u00e9n\u00e9r\u00e9s","volume":"10","author":"Jamet P.","year":"1976","unstructured":"Jamet , P. 1976 . Estimations d'Erreur pour des \u00c9lements Finis Droits Presque D\u00e9g\u00e9n\u00e9r\u00e9s . RAIRO Analyse Num\u00e9rique 10 , 43 -- 61 . Jamet, P. 1976. Estimations d'Erreur pour des \u00c9lements Finis Droits Presque D\u00e9g\u00e9n\u00e9r\u00e9s. RAIRO Analyse Num\u00e9rique 10, 43--61.","journal-title":"RAIRO Analyse Num\u00e9rique"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0729031"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137907"},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 28--37","author":"Li X.-Y.","unstructured":"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 . 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."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/37401.37422"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796314124"},{"key":"e_1_2_2_24_1","unstructured":"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.  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."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19990410)44:10<1383::AID-NME616>3.0.CO;2-I"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882293"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Osher S. and Fedkiw R. 2002. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag New York.  Osher S. and Fedkiw R. 2002. Level Set Methods and Dynamic Implicit Surfaces . Springer-Verlag New York.","DOI":"10.1007\/b98879"},{"key":"e_1_2_2_28_1","volume-title":"Proceedings of the 14th International Meshing Roundtable, 203--219","author":"Oudot S.","unstructured":"Oudot , S. , Rineau , L. , and Yvinec , M . 2005. Meshing Volumes Bounded by Smooth Surfaces . In Proceedings of the 14th International Meshing Roundtable, 203--219 . Oudot, S., Rineau, L., and Yvinec, M. 2005. Meshing Volumes Bounded by Smooth Surfaces. In Proceedings of the 14th International Meshing Roundtable, 203--219."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015816"},{"key":"e_1_2_2_31_1","unstructured":"Shewchuk J. R. 2002. What Is a Good Linear Element? Interpolation Conditioning and Quality Measures. In Eleventh International Meshing Roundtable 115--126.  Shewchuk J. R. 2002. What Is a Good Linear Element? Interpolation Conditioning and Quality Measures. In Eleventh International Meshing Roundtable 115--126."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S001309150007783X"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620201103"},{"key":"e_1_2_2_34_1","volume-title":"Fast Surface Reconstruction Using the Level Set Method. In Workshop on Variational and Level Set Methods, 194--202","author":"Zhao H.-K.","unstructured":"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 . 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."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276448","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276377.1276448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:18Z","timestamp":1750258338000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276377.1276448"}},"subtitle":["fast tetrahedral meshes with good dihedral angles"],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7,29]]}},"alternative-id":["10.1145\/1276377.1276448"],"URL":"https:\/\/doi.org\/10.1145\/1276377.1276448","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}