Jingqi Zhang , Zihao Zhou , Lixin Ren , Junyuan Liu , Ying Li , Xiaowei He
{"title":"A parallel multiscale FIM approach in solving the Eikonal equation on GPU","authors":"Jingqi Zhang , Zihao Zhou , Lixin Ren , Junyuan Liu , Ying Li , Xiaowei He","doi":"10.1016/j.cad.2025.103949","DOIUrl":null,"url":null,"abstract":"<div><div>Signed Distance Fields (SDFs) are essential in various applications, particularly in level set problems, where computing the SDF is equivalent to solving the Eikonal equation. Common approaches to solving these equations include the Fast Marching Method (FMM), the Fast Sweeping Method (FSM), and the Fast Iterative Method (FIM). However, FMM and FSM face significant challenges in parallelization, increasing interest in developing FIM for GPU architectures. In this paper, we extend the innovative FIM algorithm (Huang, 2021), which is GPU-friendly but relies on a single uniform grid, by incorporating multiscale techniques to accelerate wavefront propagation from source points to infinity. Unlike the traditional Fast Iterative Method, which operates on a single uniform grid and propagates the wavefront at a constant speed of one grid spacing per iteration, our multiscale approach applies a hierarchy of varying propagation speeds to accelerate the convergence. Once all source and infinite points are properly initialized, only a few FIM iterations are required to refine the values of points near the source. A coarser-grained scale, with twice the spacing of the finer grid, is then used to propagate values from accepted and tentative points to the outer regions. This process is repeated until the top-level scale is reached. Subsequently, we reverse this process by performing FIM calculations from the coarsest scale until reaching the finest grid, thereby completing a V-cycle. With multiscale V-cycles, the solution progressively converges across the entire computational domain. Comparative experimental results show that our algorithm improves computational efficiency by approximately 128% over the GPU-based Fast Marching Method and by a factor of 23 compared to the improved FIM algorithm (Huang, 2021) at scale of <span><math><mrow><mi>N</mi><mo>=</mo><mn>2</mn><mi>E</mi><mn>8</mn></mrow></math></span>. This optimized approach applies to numerical simulations of multi-body systems, including fluid–structure interactions, as well as numerical analyses of flooding and earthquake scenarios.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"189 ","pages":"Article 103949"},"PeriodicalIF":3.1000,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448525001101","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Signed Distance Fields (SDFs) are essential in various applications, particularly in level set problems, where computing the SDF is equivalent to solving the Eikonal equation. Common approaches to solving these equations include the Fast Marching Method (FMM), the Fast Sweeping Method (FSM), and the Fast Iterative Method (FIM). However, FMM and FSM face significant challenges in parallelization, increasing interest in developing FIM for GPU architectures. In this paper, we extend the innovative FIM algorithm (Huang, 2021), which is GPU-friendly but relies on a single uniform grid, by incorporating multiscale techniques to accelerate wavefront propagation from source points to infinity. Unlike the traditional Fast Iterative Method, which operates on a single uniform grid and propagates the wavefront at a constant speed of one grid spacing per iteration, our multiscale approach applies a hierarchy of varying propagation speeds to accelerate the convergence. Once all source and infinite points are properly initialized, only a few FIM iterations are required to refine the values of points near the source. A coarser-grained scale, with twice the spacing of the finer grid, is then used to propagate values from accepted and tentative points to the outer regions. This process is repeated until the top-level scale is reached. Subsequently, we reverse this process by performing FIM calculations from the coarsest scale until reaching the finest grid, thereby completing a V-cycle. With multiscale V-cycles, the solution progressively converges across the entire computational domain. Comparative experimental results show that our algorithm improves computational efficiency by approximately 128% over the GPU-based Fast Marching Method and by a factor of 23 compared to the improved FIM algorithm (Huang, 2021) at scale of . This optimized approach applies to numerical simulations of multi-body systems, including fluid–structure interactions, as well as numerical analyses of flooding and earthquake scenarios.
期刊介绍:
Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design.
Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.