{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:16:18Z","timestamp":1782317778770,"version":"3.54.5"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"INRIA Team ALICE"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2016,9,22]]},"abstract":"<jats:p>\n            This article introduces a method that generates a hexahedral-dominant mesh from an input tetrahedral mesh. It follows a three-step pipeline similar to the one proposed by Carrier Baudoin et al.: (1) generate a frame field, (2) generate a pointset\n            <jats:italic>P<\/jats:italic>\n            that is mostly organized on a regular grid locally aligned with the frame field, and (3) generate the hexahedral-dominant mesh by recombining the tetrahedra obtained from the constrained Delaunay triangulation of\n            <jats:italic>P<\/jats:italic>\n            .\n          <\/jats:p>\n          <jats:p>For step (1), we use a state-of-the-art algorithm to generate a smooth frame field. For step (2), we introduce an extension of Periodic Global Parameterization to the volumetric case. As compared with other global parameterization methods (such as CubeCover), our method relaxes some global constraints to avoid creating degenerate elements, at the expense of introducing some singularities that are meshed using non-hexahedral elements. For step (3), we build on the formalism introduced by Meshkat and Talmor, fill in a gap in their proof, and provide a complete enumeration of all the possible recombinations, as well as an algorithm that efficiently detects all the matches in a tetrahedral mesh.<\/jats:p>\n          <jats:p>The method is evaluated and compared with the state of the art on a database of examples with various mesh complexities, varying from academic examples to real industrial cases. Compared with the method of Carrier-Baudoin et al., the method results in better scores for classical quality criteria of hexahedral-dominant meshes (hexahedral proportion, scaled Jacobian, etc.). The method also shows better robustness than CubeCover and its derivatives when applied to complicated industrial models.<\/jats:p>","DOI":"10.1145\/2930662","type":"journal-article","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T14:08:13Z","timestamp":1467727693000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Hexahedral-Dominant Meshing"],"prefix":"10.1145","volume":"35","author":[{"given":"Dmitry","family":"Sokolov","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lorraine"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Ray","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand-Est"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lionel","family":"Untereiner","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand-Est"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"L\u00e9vy","sequence":"additional","affiliation":[{"name":"INRIA Nancy Grand-Est"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0727091"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-009-9334-9"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531383"},{"key":"e_1_2_2_4_1","doi-asserted-by":"crossref","unstructured":"I. M. Bomze M. Budinich P. M. Pardalos and M. Pelillo. 1999. The maximum clique problem. In Handbook of Combinatorial Optimization 4. Kluwer Academic.  I. M. Bomze M. Budinich P. M. Pardalos and M. Pelillo. 1999. The maximum clique problem. In Handbook of Combinatorial Optimization 4. Kluwer Academic.","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"e_1_2_2_5_1","unstructured":"Arnaud Botella Bruno L\u00e9vy and Guillaume Caumon. 2015. Indirect unstructured hex-dominant mesh generation using tetrahedra recombination. Comput. Geosci. (2015) 1--15. DOI:http:\/\/dx.doi.org\/10.1007\/ s10596-015-9484-9  Arnaud Botella Bruno L\u00e9vy and Guillaume Caumon. 2015. Indirect unstructured hex-dominant mesh generation using tetrahedra recombination. Comput. Geosci. (2015) 1--15. DOI:http:\/\/dx.doi.org\/10.1007\/ s10596-015-9484-9"},{"key":"e_1_2_2_6_1","volume-title":"A frontal approach to hex-dominant mesh generation. Adv. Model. Simul. Eng. Sci. 1, 1","author":"Carrier-Baudouin Tristan","year":"2014","unstructured":"Tristan Carrier-Baudouin , Jean-Franois Remacle , Emilie Marchandise , Franois Henrotte , and Christophe Geuzaine . 2014. A frontal approach to hex-dominant mesh generation. Adv. Model. Simul. Eng. Sci. 1, 1 ( 2014 ). DOI:http:\/\/dx.doi.org\/10.1186\/2213-7467-1-8 10.1186\/2213-7467-1-8 Tristan Carrier-Baudouin, Jean-Franois Remacle, Emilie Marchandise, Franois Henrotte, and Christophe Geuzaine. 2014. A frontal approach to hex-dominant mesh generation. Adv. Model. Simul. Eng. Sci. 1, 1 (2014). DOI:http:\/\/dx.doi.org\/10.1186\/2213-7467-1-8"},{"key":"e_1_2_2_7_1","unstructured":"CGAL. CGAL Open Source Project. www.cgal.org.  CGAL. CGAL Open Source Project. www.cgal.org."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508372"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/77635.77639"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8248(90)90012-Y"},{"key":"e_1_2_2_12_1","volume-title":"Computer Graphics Forum (Special Issue of Symposium on Geometry Processing 2011)","author":"Gregson J.","year":"2011","unstructured":"J. Gregson , A. Sheffer , and E. Zhang . 2011. All-hex mesh generation via volumetric polycube deformation . Computer Graphics Forum (Special Issue of Symposium on Geometry Processing 2011) 30, 5 ( 2011 ), to appear. J. Gregson, A. Sheffer, and E. Zhang. 2011. All-hex mesh generation via volumetric polycube deformation. Computer Graphics Forum (Special Issue of Symposium on Geometry Processing 2011) 30, 5 (2011), to appear."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602141"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024177"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.250"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01060.x"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778856"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366196"},{"key":"e_1_2_2_19_1","volume-title":"Introduction to Combinatorial Mathematics","author":"Liu C. L.","unstructured":"C. L. Liu . 1968. Introduction to Combinatorial Mathematics . McGraw-Hill , New York, NY . C. L. Liu. 1968. Introduction to Combinatorial Mathematics. McGraw-Hill, New York, NY."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508388"},{"key":"e_1_2_2_21_1","unstructured":"Bruno L\u00e9vy. 2000. O<scp>pen<\/scp>NL Open Numerical Library. (2000). http:\/\/alice.loria.fr\/index.php\/software\/4-library\/23-opennl.html.  Bruno L\u00e9vy. 2000. O<scp>pen<\/scp>NL Open Numerical Library. (2000). http:\/\/alice.loria.fr\/index.php\/software\/4-library\/23-opennl.html."},{"key":"e_1_2_2_22_1","unstructured":"Bruno L\u00e9vy. 2015. G<scp>eogram<\/scp> a programming library of geometric algorithms. (2015). http:\/\/alice.loria.fr\/software\/geogram\/doc\/html\/index.html.  Bruno L\u00e9vy. 2015. G<scp>eogram<\/scp> a programming library of geometric algorithms. (2015). http:\/\/alice.loria.fr\/software\/geogram\/doc\/html\/index.html."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1833349.1778856"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0207(20000910\/20)49:1\/2<17::AID-NME920>3.0.CO;2-U"},{"key":"e_1_2_2_25_1","volume-title":"FPG: A code generator. In Real Numbers and Computers. 47--60","author":"Pion Meyer","year":"2008","unstructured":"Meyer and Pion . 2008 . FPG: A code generator. In Real Numbers and Computers. 47--60 . http:\/\/hal.inria.fr\/inria-00344297 Meyer and Pion. 2008. FPG: A code generator. In Real Numbers and Computers. 47--60. http:\/\/hal.inria.fr\/inria-00344297"},{"key":"e_1_2_2_26_1","volume-title":"Proceedings, 7th International Meshing Roundtable 98","author":"Meyers Ray J.","year":"1998","unstructured":"Ray J. Meyers , Timothy J. Tautges , Philip M. Tuchinsky , and Dr. Philip M. Tuchinsky . 1998 . The \u201chex-tet\u201d hex-dominant meshing algorithm as implemented in CUBIT. In in CUBIT; Proceedings, 7th International Meshing Roundtable 98 . 151--158. Ray J. Meyers, Timothy J. Tautges, Philip M. Tuchinsky, and Dr. Philip M. Tuchinsky. 1998. The \u201chex-tet\u201d hex-dominant meshing algorithm as implemented in CUBIT. In in CUBIT; Proceedings, 7th International Meshing Roundtable 98. 151--158."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.02014.x"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183287.1183297"},{"key":"e_1_2_2_29_1","volume-title":"On smooth 3d frame field design. CoRR http:\/\/arxiv.org\/abs\/1507.03351","author":"Ray Nicolas","year":"2015","unstructured":"Nicolas Ray and Dmitry Sokolov . 2015. On smooth 3d frame field design. CoRR http:\/\/arxiv.org\/abs\/1507.03351 ( 2015 ). Nicolas Ray and Dmitry Sokolov. 2015. On smooth 3d frame field design. CoRR http:\/\/arxiv.org\/abs\/1507.03351 (2015)."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-008-0091-4"},{"key":"e_1_2_2_31_1","volume-title":"Adaptive precision floating-point arithmetic. Discr. Comput. Geom. 18, 3","year":"1997","unstructured":"Shewchuk. 1997. Adaptive precision floating-point arithmetic. Discr. Comput. Geom. 18, 3 ( 1997 ). Shewchuk. 1997. Adaptive precision floating-point arithmetic. Discr. Comput. Geom. 18, 3 (1997)."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629697"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.754"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1735603.1735629"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930662","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:25Z","timestamp":1750222585000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9,22]]}},"alternative-id":["10.1145\/2930662"],"URL":"https:\/\/doi.org\/10.1145\/2930662","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,29]]},"assertion":[{"value":"2015-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}