{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T12:50:48Z","timestamp":1753879848510,"version":"3.41.2"},"reference-count":36,"publisher":"ASME International","issue":"4","license":[{"start":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T00:00:00Z","timestamp":1585785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.asme.org\/publications-submissions\/publishing-information\/legal-policies"}],"content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This paper presents a new computational method based on the feasible-set method (Berndt, Kucharik, and Shashkov, 2010, \u201cUsing the Feasible Set Method for Rezoning in ALE,\u201d Procedia Comput., 1(1), pp. 1879\u20131886 and Vachal, Garimella, and Shashkov, 2004, \u201cUntangling of 2D Meshes in ALE Simulations,\u201d J. Comput. Phys., 196, pp. 627\u2013644) for removing inverted elements in surface and volume meshes. The proposed method calculates a region for each node called a \u201cfeasible set\u201d in which the node can reside without creating an inverted element. The node is then relocated within the region so that the number of inverted elements is reduced. Unlike the original feasible-set method, it is applicable to nonplanar surface meshes, volume meshes, and also has a step for recovering a feasible set when the set is empty. While various useful mesh optimization techniques have been proposed over several decades, many of them do not work well if the initial mesh has inverted elements. Additionally, some mesh optimizations create new inverted elements when the mesh topology is highly irregular. The goal of the proposed method is to remove mesh inversion without creating a new inverted element. The proposed method is useful for preconditioning for conventional smoothing techniques, which require that the initial mesh be inversion free. It is also useful for correcting inverted elements created by conventional smoothing techniques. The effectiveness of the improved method has been verified by applying it to the facet-repair and the boundary-layer generation problems.<\/jats:p>","DOI":"10.1115\/1.4046588","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T16:50:41Z","timestamp":1583513441000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":0,"title":["Improved Feasible-Set Method for Removing Mesh Inversion"],"prefix":"10.1115","volume":"20","author":[{"given":"Soji","family":"Yamakawa","sequence":"first","affiliation":[{"name":"The Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213"}]},{"given":"Kenji","family":"Shimada","sequence":"first","affiliation":[{"name":"The Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213"}]}],"member":"33","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"1","key":"2020040209275753500_CIT0001","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1016\/j.procs.2010.04.211","article-title":"Using the Feasible Set Method for Rezoning in ALE","volume":"1","author":"Berndt","year":"2010","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"2020040209275753500_CIT0002","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/j.jcp.2003.11.011","article-title":"Untangling of 2D Meshes in ALE Simulations","volume":"196","author":"Vachal","year":"2004","journal-title":"J. Comput. Phys."},{"article-title":"A Methodology for FEA Over Tangled Meshes","year":"2012","author":"Danczyk","key":"2020040209275753500_CIT0003"},{"key":"2020040209275753500_CIT0004","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.proeng.2014.10.383","article-title":"Towards FEA Over Tangled Quads","volume":"82","author":"Verma","year":"2014","journal-title":"Procedia Eng."},{"key":"2020040209275753500_CIT0005","doi-asserted-by":"crossref","DOI":"10.1145\/1028523.1028541","article-title":"Invertible Finite Elements for Robust Simulation of Large Deformation","author":"Irving","year":"2004"},{"article-title":"Matrix Norms and the Condition Number: A General Framework to Improve Mesh Quality via Node-Movement","year":"1999","author":"Knupp","key":"2020040209275753500_CIT0006"},{"issue":"3","key":"2020040209275753500_CIT0007","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s003660170006","article-title":"Hexahedral and Tetrahedral Mesh Untangling","volume":"17","author":"Knupp","year":"2001","journal-title":"Eng. Comput."},{"article-title":"Tetrahedral Element Shape Optimization via the Jacobian Determinant and Condition Number","year":"1999","author":"Freitag","key":"2020040209275753500_CIT0008"},{"article-title":"Combined Laplacian and Optimization-Based Smoothing for Quadratic Mixed Surface Meshes","year":"2003","author":"Chen","key":"2020040209275753500_CIT0009"},{"issue":"6","key":"2020040209275753500_CIT0010","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1002\/nme.341","article-title":"Tetrahedral Mesh Improvement via Optimization of the Element Condition Number","volume":"53","author":"Freitag","year":"2002","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"8","key":"2020040209275753500_CIT0011","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1002\/(SICI)1097-0207(20000720)48:8<1165::AID-NME940>3.0.CO;2-Y","article-title":"Achieving Finite Element Mesh Quality via Optimization of the Jacobian Matrix Norm and Associated Quantities. Part II A Framework for Volume Mesh Optimization and the Condition Number of the Jacobian Matrix","volume":"48","author":"Knupp","year":"2000","journal-title":"Int. J. Numer. Methods Eng."},{"article-title":"Optimization-Based Reference-Matrix Rezone Strategies for Arbitrary Lagrangian-Eulerian Methods on Unstructured Meshes","year":"2001","author":"Shashkov","key":"2020040209275753500_CIT0012"},{"article-title":"Efficient and Global Optimization-Based Smoothing Methods for Mixed-Volume Meshes","year":"2013","author":"Vartziotis","key":"2020040209275753500_CIT0013"},{"article-title":"Untangling and Smoothing of Quadrilateral and Hexahedral Meshes","year":"2012","author":"Wilson","key":"2020040209275753500_CIT0014"},{"issue":"25","key":"2020040209275753500_CIT0015","doi-asserted-by":"crossref","first-page":"2775","DOI":"10.1016\/S0045-7825(03)00299-8","article-title":"Simultaneous Untangling and Smoothing of Tetrahedral Meshes","volume":"192","author":"Escobar","year":"2015","journal-title":"Comp. Meth. Appl. Mech. Eng."},{"article-title":"Local Optimization-Based Untangling Algorithms for Quadrilateral Meshes","year":"2001","author":"Freitag","key":"2020040209275753500_CIT0016"},{"issue":"1","key":"2020040209275753500_CIT0017","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/nme.4431","article-title":"A Multiobjective Mesh Optimization Framework for Mesh Quality Improvement and Mesh Untangling","volume":"94","author":"Kim","year":"2013","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"3","key":"2020040209275753500_CIT0018","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00366-012-0294-6","article-title":"A Log-Barrier Method for Mesh Quality Improvement","volume":"30","author":"Sastry","year":"2014","journal-title":"Eng. Comput."},{"issue":"4","key":"2020040209275753500_CIT0019","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s00366-014-0362-1","article-title":"A Parallel Log-Barrier Method for Mesh Quality Improvement and Untangling","volume":"30","author":"Sastry","year":"2014","journal-title":"Eng. Comput."},{"issue":"1","key":"2020040209275753500_CIT0020","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.jcp.2013.07.022","article-title":"Robust Untangling of Curvilinear Meshes","volume":"254","author":"Toulorge","year":"2013","journal-title":"J. Comput. Phys."},{"article-title":"A 44-Element Mesh of Schneiders\u2019 Pyramid Bounding the Difficulty of Hex-Meshing Problems","year":"2018","author":"Verhetsel","key":"2020040209275753500_CIT0021"},{"issue":"3\u20134","key":"2020040209275753500_CIT0022","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01198732","article-title":"A Grid-Based Algorithm for the Generation of Hexahedral Element Meshes","volume":"12","author":"Schneiders","year":"1996","journal-title":"Eng. Comput."},{"issue":"3","key":"2020040209275753500_CIT0023","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00366-011-0227-9","article-title":"Performance Characterization of Nonlinear Optimization Methods for Mesh Quality Improvement","volume":"28","author":"Sastry","year":"2012","journal-title":"Eng. Comput."},{"issue":"2","key":"2020040209275753500_CIT0024","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00366-006-0015-0","article-title":"A Comparison of Two Optimization Methods for Mesh Quality Improvement","volume":"22","author":"Diachin","year":"2006","journal-title":"Eng. Comput."},{"article-title":"An Angle-Based Approach to Two-Dimensional Mesh Smoothing","year":"2000","author":"Zhou","key":"2020040209275753500_CIT0025"},{"article-title":"Surface Mesh Optimization, Adaptation, and Untangling with High-Order Accuracy","year":"2012","author":"Clark","key":"2020040209275753500_CIT0026"},{"issue":"1","key":"2020040209275753500_CIT0027","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.procs.2010.04.039","article-title":"Towards High-Quality Untangled Meshes via a Force-Directed Graph Embedding Approach","volume":"1","author":"Bhowmick","year":"2010","journal-title":"Procedia Comput. Sci."},{"issue":"5","key":"2020040209275753500_CIT0028","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00371-011-0649-9","article-title":"Combinatorial Mesh Optimization","volume":"28","author":"Vidal","year":"2012","journal-title":"Visual Comput."},{"issue":"4","key":"2020040209275753500_CIT0029","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2766905","article-title":"Practical Hex-Mesh Optimization via Edge-Cone Rectification","volume":"34","author":"Livesu","year":"2015","journal-title":"ACM Trans. Graph."},{"issue":"6","key":"2020040209275753500_CIT0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2980179.2980231","article-title":"Computing Inversion-Free Mappings by Simplex Assembly","volume":"35","author":"Fu","year":"2016","journal-title":"ACM Trans. Graph."},{"issue":"4","key":"2020040209275753500_CIT0031","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2461912.2461931","article-title":"Injective and Bounded Distortion Mappings in 3D","volume":"32","author":"Aigerman","year":"2013","journal-title":"ACM Trans. Graph."},{"key":"2020040209275753500_CIT0032","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cag.2017.07.002","article-title":"Hexahedral Mesh Quality Improvement via Edge-Angle Optimization","volume":"70","author":"Xu","year":"2018","journal-title":"Comput. Graph."},{"issue":"3","key":"2020040209275753500_CIT0033","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s003660200019","article-title":"HEXHOOP: Modular Templates for Converting a Hex-Dominant Mesh to an All-Hex Mesh","volume":"18","author":"Yamakawa","year":"2002","journal-title":"Eng. Comput."},{"issue":"12","key":"2020040209275753500_CIT0034","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1002\/cnm.1256","article-title":"88-Element Solution to Schneiders\u2019 Pyramid Hex-Meshing Problem","volume":"26","author":"Yamakawa","year":"2010","journal-title":"Int. J. Numer. Meth. Bio. Eng."},{"key":"2020040209275753500_CIT0035","unstructured":"Xiang, Shang, and Liu, Jianfei, 2018, A 36-Element Solution To Schneiders' Pyramid Hex-Meshing Problem And a Parity-Changing Template For Hex-Mesh Revision, https:\/\/arxiv.org\/ftp\/arxiv\/papers\/1807\/1807.09415.pdf."},{"issue":"3","key":"2020040209275753500_CIT0036","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An Optimal Algorithm for Finding the Kernel of a Polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. ACM"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4046588\/6521692\/jcise_20_4_041011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4046588\/6521692\/jcise_20_4_041011.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T13:28:31Z","timestamp":1585834111000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/doi\/10.1115\/1.4046588\/1075825\/Improved-FeasibleSet-Method-for-Removing-Mesh"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,2]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4046588","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2020,4,2]]},"article-number":"041011"}}