{"title":"Computation of a Distance Field by Means of Combined\nGeometry Representation in Fluid Dynamics Simulations with Embedded\nBoundaries","authors":"M. Y. Hrebtov, R. I. Mullyadzhanov","doi":"10.1134/S1990478924040070","DOIUrl":null,"url":null,"abstract":"<p> We present a method for calculating the signed distance field to three-dimensional\ngeometric models by representing them as a result of Boolean operations on elementary objects for\neach of which the signed distance is known. Two versions of the algorithm are proposed. The first\nis a simplified version for quick calculation of the rough distance approximation (with an exact\nzero isosurface and correct separation of domains inside and outside the model). The second\nversion includes calculation of the distance to the intersection contours between elements, allowing\nthe distance to be reconstructed with a greater accuracy without considerable additional\ncomputational costs. Both methods are much faster than the computation of distance based on\nthe triangulation of the surfaces. The proposed approach also allows for interactively changing\nrelative positions and orientation of the geometry parts; this makes it possible to perform\ncalculations with moving boundaries. The approach has been tested in fluid dynamics simulation\nwith an interphase boundary and adaptive multilevel grid refinement in <span>Basilisk</span> open source code for simulation of\nmultiphase flows.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 4","pages":"697 - 708"},"PeriodicalIF":0.5800,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478924040070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
We present a method for calculating the signed distance field to three-dimensional
geometric models by representing them as a result of Boolean operations on elementary objects for
each of which the signed distance is known. Two versions of the algorithm are proposed. The first
is a simplified version for quick calculation of the rough distance approximation (with an exact
zero isosurface and correct separation of domains inside and outside the model). The second
version includes calculation of the distance to the intersection contours between elements, allowing
the distance to be reconstructed with a greater accuracy without considerable additional
computational costs. Both methods are much faster than the computation of distance based on
the triangulation of the surfaces. The proposed approach also allows for interactively changing
relative positions and orientation of the geometry parts; this makes it possible to perform
calculations with moving boundaries. The approach has been tested in fluid dynamics simulation
with an interphase boundary and adaptive multilevel grid refinement in Basilisk open source code for simulation of
multiphase flows.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.