.png){kind=icon}
.png){kind=icon}
Return
A Scalable, Parallel Algorithm for Signed Distance Function Computation in a Novel Computer-Aided Engineering Framework
.png){kind=icon}
PRE
AI
DOI：10.1007/s40304-025-00468-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study presents an innovative approach to bridge the gap between computer-aided design (CAD) and computer-aided engineering (CAE) by utilizing the signed distance function (SDF) as a geometric representation for CAE. We propose an efficient parallel computation algorithm for generating the SDF representation from a CAD model. It comprises three components: the construction of a globally defined SDF from a given set of oriented point clouds through parallel computation of local SDFs, the application of a multi-resolution fast sweeping method to compute local SDFs, and the design of a three-dimensional interval tree to expedite SDF queries. The algorithm's effectiveness and precision are substantiated through a series of experiments involving various CAD models. The numerical partial differential equation (PDE) results offer preliminary evidence of the feasibility and practicality of a novel CAE framework grounded on the SDF representation. This proposed method ultimately fosters a seamless integration between CAD and CAE through the SDF representation.
Keywords:
Signed distance function
Computer-aided design
Computer-aided engineering
Parallel computation
Journal
C
IF:
0
Papers:
15
Citations:
0