{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:55:07Z","timestamp":1760043307900},"reference-count":9,"publisher":"ASME International","issue":"4","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,12,1]]},"abstract":"<jats:p>This article presents a technique for the adaptive refinement of tetrahedral meshes. What makes this method new is that no neighbor information is required for the refined mesh to be compatible everywhere. Refinement consists of inserting new vertices at edge midpoints until some tolerance (geometric or otherwise) is met. For a tetrahedron, the six edges present 26=64 possible subdivision combinations. The challenge is to triangulate the new vertices (i.e., the original vertices plus some subset of the edge midpoints) in a way that neighboring tetrahedra always generate the same triangles on their shared boundary. A geometric solution based on edge lengths was developed previously, but did not account for geometric degeneracies (edges of equal length). This article provides a solution that works in all cases, while remaining entirely communication-free.<\/jats:p>","DOI":"10.1115\/1.2052806","type":"journal-article","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T23:14:06Z","timestamp":1131146046000},"page":"309-316","update-policy":"http:\/\/dx.doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":4,"title":["Communication-Free Streaming Mesh Refinement"],"prefix":"10.1115","volume":"5","author":[{"given":"Philippe P.","family":"P\u00e9bay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2005,3,22]]},"reference":[{"key":"2019100315530526300_c1","doi-asserted-by":"crossref","volume-title":"Mesh Generation","author":"Frey","DOI":"10.1002\/9780470611166"},{"key":"2019100315530526300_c2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s004660050279","article-title":"3D Mesh Refinement in Compliance with a Specified Node-Spacing Function","volume":"21","author":"Lo","journal-title":"Comp. Mech."},{"key":"2019100315530526300_c3","article-title":"A Measure of the Conformity of a Mesh to an Isotropic Metric","volume-title":"Proceedings of the 10th International Meshing Roundtable","author":"Labb\u00e9"},{"issue":"2","key":"2019100315530526300_c4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/10867651.1996.10487456","article-title":"Simple and Efficient Polygonization of Implicit Surfaces","volume":"1","author":"Velho","journal-title":"Journal of Graphics Tools"},{"key":"2019100315530526300_c5","doi-asserted-by":"crossref","unstructured":"Chung, A. J., and Field, A. J., 2000, \u201cA Simple Recursive Tessellator for Adaptive Surface Triangulation,\u201d Journal of Graphics Tools, 5(3).","DOI":"10.1080\/10867651.2000.10487524"},{"key":"2019100315530526300_c6","first-page":"61","article-title":"A Scheme for Edge-based Adaptive Tetrahedron Subdivision","volume-title":"Mathematical Visualization","author":"Ruprecht"},{"key":"2019100315530526300_c7","doi-asserted-by":"crossref","unstructured":"Oliker, L., Biswas, R., and Gabow, H. N., 2000, \u201cParallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing,\u201d Parallel Comput., pp. 1583\u20131608.","DOI":"10.1016\/S0167-8191(00)00047-8"},{"issue":"244","key":"2019100315530526300_c8","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1090\/S0025-5718-03-01485-6","article-title":"Analysis of Triangle Quality Measures","volume":"72","author":"P\u00e9bay","journal-title":"Math. Comput.","ISSN":"http:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"2019100315530526300_c9","doi-asserted-by":"crossref","unstructured":"Thompson, D. C., and P\u00e9bay, P. P., 2004, \u201cPerformance of a Streaming Mesh Refinement Algorithm,\u201d Sandia Report No. SAND2004-3858, Sandia National Laboratories.","DOI":"10.2172\/919132"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/5\/4\/309\/5774853\/309_1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/5\/4\/309\/5774853\/309_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:53:13Z","timestamp":1570132393000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/5\/4\/309\/474333\/CommunicationFree-Streaming-Mesh-Refinement"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,22]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.2052806","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,22]]}}}