{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T14:53:48Z","timestamp":1783522428788,"version":"3.55.0"},"reference-count":103,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER award 1652515, IIS-1320635, DMS-1436591, DMS-1821334, OAC-1835712, OIA-1937043, CHS-1908767, CHS-1901091"],"award-info":[{"award-number":["CAREER award 1652515, IIS-1320635, DMS-1436591, DMS-1821334, OAC-1835712, OIA-1937043, CHS-1908767, CHS-1901091"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2018YFB1107402"],"award-info":[{"award-number":["2018YFB1107402"]}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"crossref","award":["P2TIP2_175859"],"award-info":[{"award-number":["P2TIP2_175859"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rational triangle insertion with a new incremental approach to construct and optimize the output mesh, interleaving triangle insertion and mesh optimization. Our approach makes it possible to maintain a valid floating-point tetrahedral mesh at all algorithmic stages, eliminating the need for costly constructions with rational numbers used by TetWild, while maintaining full robustness and similar output quality. This allows us to improve on TetWild in two ways. First, our algorithm is significantly faster, with running time comparable to less robust Delaunay-based tetrahedralization algorithms. Second, our algorithm is guaranteed to produce a valid tetrahedral mesh with floating-point vertex coordinates, while TetWild produces a valid mesh with rational coordinates which is not guaranteed to be valid after floating-point conversion. As a trade-off, our algorithm no longer guarantees that all input triangles are present in the output mesh, but in practice, as confirmed by our tests on the Thingi10k dataset, the algorithm always succeeds in inserting all input triangles.<\/jats:p>","DOI":"10.1145\/3386569.3392385","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T11:44:27Z","timestamp":1597232667000},"update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":166,"title":["Fast tetrahedral meshing in the wild"],"prefix":"10.1145","volume":"39","author":[{"given":"Yixin","family":"Hu","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teseo","family":"Schneider","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bolun","family":"Wang","sequence":"additional","affiliation":[{"name":"Beihang University, China and New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Zorin","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Panozzo","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"L. A. Freitag and C. Ollivier-Gooch. 1998. Tetrahedral Mesh Improvement Using Swapping and Smoothing. Internat. J. Numer. Methods Engrg. 40 (05 1998).","DOI":"10.1002\/(SICI)1097-0207(19971115)40:21<3979::AID-NME251>3.0.CO;2-9"},{"key":"e_1_2_2_2_1","volume-title":"Proceedings of the 22nd International Meshing Roundtable. Springer International Publishing, Cham, 241--261","author":"Alauzet F.","unstructured":"F. Alauzet and D. Marcum. 2014. A Closed Advancing-Layer Method With Changing Topology Mesh Movement for Viscous Mesh Generation. In Proceedings of the 22nd International Meshing Roundtable. Springer International Publishing, Cham, 241--261."},{"key":"e_1_2_2_3_1","first-page":"54","article-title":"Harmonic Triangulations","volume":"38","author":"Alexa M.","year":"2019","unstructured":"M. Alexa. 2019. Harmonic Triangulations. ACM Transactions on Graphics (Proceedings of SIGGRAPH) 38, 4 (2019), 54.","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH)"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073238"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073238"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-010-0416-3"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2014.09.002"},{"key":"e_1_2_2_8_1","volume-title":"ImatiSTL - Fast and Reliable Mesh Processing with a Hybrid Kernel","author":"Attene M.","unstructured":"M. Attene. 2017. ImatiSTL - Fast and Reliable Mesh Processing with a Hybrid Kernel. Springer Berlin Heidelberg, Berlin, Heidelberg, 86--96."},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"M. Attene M. Campen and L. Kobbelt. 2013. Polygon Mesh Repairing: An Application Perspective. ACM Comput. Surv. 45 2 Article 15 (March 2013) 33 pages.","DOI":"10.1145\/2431211.2431214"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2009.06.002"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/8685"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"B. S. Baker E. Grosse and C. S. Rafferty. 1988. Nonobtuse triangulation of polygons. Discrete & Computational Geometry 3 2 (01 Jun 1988) 147--168.","DOI":"10.1007\/BF02187904"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201337"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2015.06.016"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80059-5"},{"key":"e_1_2_2_17_1","unstructured":"G. Bernstein. 2013. Cork Boolean Library. https:\/\/github.com\/gilbo\/cork."},{"key":"e_1_2_2_18_1","doi-asserted-by":"crossref","unstructured":"G. Bernstein and D. Fussell. 2009. Fast Exact Linear Booleans. In SGP. Eurographics Association Aire-la-Ville Switzerland Switzerland 1269--1278.","DOI":"10.1111\/j.1467-8659.2009.01504.x"},{"key":"e_1_2_2_19_1","volume-title":"Proc. IWCGA. Springer-Verlag","author":"Bieri H.","unstructured":"H. Bieri and W. Nef. 1988. Elementary Set Operations with D-dimensional Polyhedra. In Proc. IWCGA. Springer-Verlag, Berlin, Heidelberg, 97--112."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-016-9772-8"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00054-2"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","unstructured":"J.-D. Boissonnat and S. Oudot. 2005. Provably Good Sampling and Meshing of Surfaces. Graphical Models 67 5 (09 2005) 405--451. 10.1016\/j.gmod.2005.01.004","DOI":"10.1016\/j.gmod.2005.01.004"},{"key":"e_1_2_2_23_1","volume-title":"Quartet: A tetrahedral mesh generator that does isosurface stuffing with an acute tetrahedral tile. https:\/\/github.com\/crawforddoran\/quartet.","author":"Bridson R.","year":"2014","unstructured":"R. Bridson and C. Doran. 2014. Quartet: A tetrahedral mesh generator that does isosurface stuffing with an acute tetrahedral tile. https:\/\/github.com\/crawforddoran\/quartet."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33573-0_12"},{"key":"e_1_2_2_25_1","volume-title":"Repairing and Meshing Imperfect Shapes with Delaunay Refinement. In 2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling (SPM '09)","author":"Busaryev O.","unstructured":"O. Busaryev, T. K. Dey, and J. A. Levine. 2009. Repairing and Meshing Imperfect Shapes with Delaunay Refinement. In 2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling (SPM '09). ACM, 25--33."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01609.x"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","unstructured":"S. A. Canann S. N. Muthukrishnan and R. K. Phillips. 1996. Topological refinement procedures for triangular finite element meshes. Engineering with Computers 12 3 (01 Sep 1996) 243--255. 10.1007\/BF01198738","DOI":"10.1007\/BF01198738"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-874X(93)90056-V"},{"key":"e_1_2_2_29_1","first-page":"299","article-title":"Optimal Delaunay Triangulations","volume":"22","author":"Chen L.","year":"2004","unstructured":"L. Chen and J.-c. Xu. 2004. Optimal Delaunay Triangulations. Journal of Computational Mathematics 22, 2 (2004), 299--308.","journal-title":"Journal of Computational Mathematics"},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the 16th International Meshing Roundtable. Springer, Springer Berlin Heidelberg","author":"Cheng S.-W.","unstructured":"S.-W. Cheng, T. K. Dey, and J. A. Levine. 2008. A Practical Delaunay Meshing Algorithm for a Large Class of Domains. In Proceedings of the 16th International Meshing Roundtable. Springer, Springer Berlin Heidelberg, Berlin, Heidelberg, 477--494."},{"key":"e_1_2_2_31_1","unstructured":"S.-W. Cheng T. K. Dey and J. Shewchuk. 2012. Delaunay Mesh Generation. Chapman and Hall\/CRC Boca Raton Florida."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553881"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161150"},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02","author":"Cohen-Steiner D.","unstructured":"D. Cohen-Steiner, E. C. de Verdi\u00e8re, and M. Yvinec. 2002. Conforming Delaunay Triangulations in 3D. In Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02. ACM Press, 217--233."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33573-0_15"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377712"},{"key":"e_1_2_2_37_1","first-page":"214","article-title":"An efficient method of triangulating equi-valued surfaces by using tetrahedral cells","volume":"74","author":"Doi A.","year":"1991","unstructured":"A. Doi and A. Koide. 1991. An efficient method of triangulating equi-valued surfaces by using tetrahedral cells. IEICE TRANSACTIONS on Information and Systems 74, 1 (1991), 214--224.","journal-title":"IEICE TRANSACTIONS on Information and Systems"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504459.2504507"},{"key":"e_1_2_2_39_1","volume-title":"Technical Report 01121419. Inria Research Centre Grenoble, Rhone-Alpes.","author":"Douze M.","year":"2015","unstructured":"M. Douze, J.-S. Franco, and B. Raffin. 2015. QuickCSG: Arbitrary and Faster Boolean Combinations of N Solids. Technical Report 01121419. Inria Research Centre Grenoble, Rhone-Alpes."},{"key":"e_1_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Q. Du and D. Wang. 2003. Tetrahedral Mesh Generation and Optimization Based on Centroidal Voronoi Tessellations. International journal for numerical methods in engineering 56 9 (2003) 1355--1373.","DOI":"10.1002\/nme.616"},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"N. Faraj J.-M. Thiery and T. Boubekeur. 2016. Multi-Material Adaptive Volume Remesher. Compurer and Graphics Journal (proc. Shape Modeling International 2016) 58 (2016) 150--160.","DOI":"10.1016\/j.cag.2016.05.019"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201358"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766938"},{"key":"e_1_2_2_44_1","unstructured":"J. A. George. 1971. Computer Implementation of the Finite Element Method. Ph.D. Dissertation. Stanford University Stanford CA USA. AAI7205916."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.808"},{"key":"e_1_2_2_46_1","volume-title":"Proceedings of the IASS Symposium","author":"Ghomi A. T.","year":"2018","unstructured":"A. T. Ghomi, M. Bolhassan, A. Nejur, and M. Akbarzadeh. 2018. Effect of Subdivision of Force Diagrams on the Local Buckling, Load-Path and Material Use of Founded Forms. In Proceedings of the IASS Symposium 2018, Creativity in Structural Design. MIT, Boston, USA."},{"key":"e_1_2_2_47_1","volume-title":"Proc. ESA. Springer Berlin Heidelberg","author":"Granados M.","unstructured":"M. Granados, P. Hachenberger, S. Hert, L. Kettner, K. Mehlhorn, and M. Seel. 2003. Boolean operations on 3D selective Nef complexes: Data structure, algorithms, and implementation. In Proc. ESA. Springer Berlin Heidelberg, Berlin, Heidelberg, 654--666."},{"key":"e_1_2_2_48_1","unstructured":"G. Guennebaud B. Jacob et al. 2010. Eigen v3."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2003.10487580"},{"key":"e_1_2_2_50_1","unstructured":"P. Hachenberger and L. Kettner. 2019. 3D Boolean Operations on Nef Polyhedra. In CGAL User and Reference Manual (4.14 ed.). CGAL Editorial Board."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02335-9_5"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2632720"},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Y. Hu T. Schneider X. Gao Q. Zhou A. Jacobson D. Zorin and D. Panozzo. 2019. TriWild: Robust Triangulation with Curve Constraints. ACM Trans. Graph. (2019).","DOI":"10.1145\/3306346.3323011"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201353"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699463"},{"key":"e_1_2_2_56_1","volume-title":"Proceedings of the 16th International Meshing Roundtable, IMR 2007, 3--23","author":"Klingner B.","unstructured":"B. Klingner and J. Shewchuk. 2007. Aggressive Tetrahedral Mesh Improvement. Proceedings of the 16th International Meshing Roundtable, IMR 2007, 3--23."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275808.1276448"},{"key":"e_1_2_2_58_1","unstructured":"B. L\u00e9vy. 2019. Geogram. http:\/\/alice.loria.fr\/index.php\/software\/4-library\/75-geogram.html."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185604"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/37402.37422"},{"key":"e_1_2_2_61_1","volume-title":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, ACM","author":"Magalh\u00e3es S. V.","unstructured":"S. V. Magalh\u00e3es, W. R. Franklin, and M. V. Andrade. 2017. Fast exact parallel 3D mesh intersection algorithm using only orientation predicates. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, ACM, New York, NY, USA, 44."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766950"},{"key":"e_1_2_2_63_1","unstructured":"A. Masoud. 2016. 3D Graphical Statics Using Reciprocal Polyhedral Diagrams. Ph.D. Dissertation. ETH Zruich Stefano Franscini Platz 5 Zurich CH 8093."},{"key":"e_1_2_2_64_1","volume-title":"Proc. Symposium on Computer Animation.","author":"Molino N.","unstructured":"N. Molino, R. Bridson, and R. Fedkiw. 2003. Tetrahedral Mesh Generation for Deformable Bodies. In Proc. Symposium on Computer Animation."},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195901000699"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566585"},{"key":"e_1_2_2_67_1","volume-title":"Proc. SIGGRAPH. ACM","author":"Naylor B.","unstructured":"B. Naylor, J. Amanatides, and W. Thibault. 1990. Merging BSP trees yields polyhedral set operations. In Proc. SIGGRAPH. ACM, New York, NY, USA, 115--124."},{"key":"e_1_2_2_68_1","volume-title":"Arrangements of cellular complexes. CoRR abs\/1704.00142","author":"Paoluzzi A.","year":"2017","unstructured":"A. Paoluzzi, V. Shapiro, and A. DiCarlo. 2017. Arrangements of cellular complexes. CoRR abs\/1704.00142 (2017). arXiv:1704.00142 http:\/\/arxiv.org\/abs\/1704.00142"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01545.x"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(87)90093-3"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983621"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2016.07.018"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1021"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620151206"},{"key":"e_1_2_2_75_1","volume-title":"ACM SIGGRAPH 2010 Talks. ACM, ACM","author":"Schmidt R.","unstructured":"R. Schmidt and K. Singh. 2010. Meshmixer: an interface for rapid mesh composition. In ACM SIGGRAPH 2010 Talks. ACM, ACM, New York, NY, USA, 6."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3272127.3275067"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","unstructured":"M. Schweiger and S. Arridge. 2016. Basis mapping methods for forward and inverse problems: BASIS MAPPING METHODS. Internat. J. Numer. Methods Engrg. 109 (05 2016). 10.1002\/nme.5271","DOI":"10.1002\/nme.5271"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03168.x"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015816"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2018.03.001"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2018.03.021"},{"key":"e_1_2_2_82_1","first-page":"257","article-title":"Unstructured Mesh Generation. Chapman and Hall\/CRC, Boca Raton, Florida","volume":"10","author":"Shewchuk J.","year":"2012","unstructured":"J. Shewchuk. 2012. Unstructured Mesh Generation. Chapman and Hall\/CRC, Boca Raton, Florida, Chapter 10, 257--297.","journal-title":"Chapter"},{"key":"e_1_2_2_83_1","volume-title":"Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator","author":"Shewchuk J. R.","unstructured":"J. R. Shewchuk. 1996. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry Towards Geometric Engineering, Ming C. Lin and Dinesh Manocha (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 203--222."},{"key":"e_1_2_2_84_1","first-page":"3","article-title":"Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates","volume":"18","author":"Shewchuk J. R.","year":"1997","unstructured":"J. R. Shewchuk. 1997. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete & Computational Geometry 18, 3 (Oct. 1997), 305--363.","journal-title":"Discrete & Computational Geometry"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276894"},{"key":"e_1_2_2_86_1","unstructured":"J. R. Shewchuk. 1999. Lecture Notes on Delaunay Mesh Generation. (1999)."},{"key":"e_1_2_2_87_1","unstructured":"J. R. Shewchuk. 2002a. Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery. In Eleventh International Meshing Roundtable. Sandia National Laboratories 193--204."},{"key":"e_1_2_2_88_1","volume-title":"11th International Meshing Roundtable. 115--126","author":"Shewchuk J. R.","year":"2002","unstructured":"J. R. Shewchuk. 2002b. What is a good linear element? interpolation, conditioning, and quality measures. In In 11th International Meshing Roundtable. 115--126."},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629697"},{"key":"e_1_2_2_90_1","volume-title":"Proceedings of the 14th international meshing roundtable. Springer, Springer Berlin Heidelberg","author":"Si H.","unstructured":"H. Si and K. Gartner. 2005. Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations. In Proceedings of the 14th international meshing roundtable. Springer, Springer Berlin Heidelberg, Berlin, Heidelberg, 147--163."},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","unstructured":"H. Si and J. R. Shewchuk. 2014. Incrementally Constructing and Updating Constrained Delaunay Tetrahedralizations With Finite-Precision Coordinates. Engineering with Computers 30 2 (04 2014) 253--269. 10.1007\/s00366-013-0331-0","DOI":"10.1007\/s00366-013-0331-0"},{"key":"e_1_2_2_92_1","first-page":"53","article-title":"A Simple Method for Correcting Facet Orientations in Polygon Meshes Based on Ray Casting","volume":"3","author":"Takayama K.","year":"2014","unstructured":"K. Takayama, A. Jacobson, L. Kavan, and O. Sorkine-Hornung. 2014. A Simple Method for Correcting Facet Orientations in Polygon Meshes Based on Ray Casting. Journal of Computer Graphics Techniques 3, 4 (2014), 53--63.","journal-title":"Journal of Computer Graphics Techniques"},{"key":"e_1_2_2_93_1","volume-title":"Proc. SIGGRAPH. ACM","author":"Thibault W. C.","unstructured":"W. C. Thibault and B. F. Naylor. 1987. Set operations on polyhedra using binary space partitioning trees. In Proc. SIGGRAPH. ACM, New York, NY, USA, 153--162."},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531381"},{"key":"e_1_2_2_95_1","doi-asserted-by":"crossref","unstructured":"G. Varadhan S. Krishnan T. Sriram and D. Manocha. 2004. Topology preserving surface extraction using adaptive subdivision. In SGP. ACM New York NY USA 235--244.","DOI":"10.1145\/1057432.1057464"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392426"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.106"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620371203"},{"key":"e_1_2_2_99_1","unstructured":"R. Wein E. Berberich E. Fogel D. Halperin M. Hemmer O. Salzman and B. Zukerman. 2018. 2D Arrangements. In CGAL User and Reference Manual (4.13 ed.). CGAL Editorial Board."},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.1983.262997"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-011-0571-1"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925901"},{"key":"e_1_2_2_103_1","first-page":"3D","article-title":"Thingi10K","volume":"10","author":"Zhou Q.","year":"2016","unstructured":"Q. Zhou and A. Jacobson. 2016. Thingi10K: A Dataset of 10, 000 3D-Printing Models. CoRR abs\/1605.04797 (2016). arXiv:1605.04797","journal-title":"A Dataset of"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3386569.3392385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:36:39Z","timestamp":1750829799000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,12]]},"references-count":103,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3386569.3392385"],"URL":"https:\/\/doi.org\/10.1145\/3386569.3392385","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,12]]},"assertion":[{"value":"2020-08-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}