Efficient evaluation of continuous signed distance to a polygonal mesh

Convolution Filtering of Continuous Signed Distance Fields for Polygonal Meshes

“…However, our approach would benefit from more efficient evaluations of the signed Euclidean distance, which is still an open research as several methods have been introduced recently. We reviewed most of them in [SFP13], but a more detailed survey of the current state of the art has yet to be done. One of the ways to increase the efficiency is the acceleration by using graphics hardware (GPU) implementation.…”

“…However, it can be accelerated by using spatial structures, pre-processing and sorting the mesh polygons, application of different traversal strategies for the selected spatial structure and using hardware acceleration. In [SFP13], different spatial structures, building and traversal strategies are discussed in details and compared to present the optimal way to calculate the distance function to a polygonal mesh. This work also discusses how to improve the performance of a single query of the distance by using packet sampling.…”

An hp-adaptive discretization algorithm for signed distance field generation

“…In recent years, many methods have been presented to accelerate the exact evaluation of signed distance functions based on polygonal representations (see e.g. [9]). Even though the computational efficiency was drastically improved, the computation time still can not fulfill the strict time constraints of applications such as interactive simulation or haptic rendering.…”

“…Therefore, we first compute the unsigned distance by finding the closest triangle of the mesh and subsequently evaluating the distance to the individual polygon. As a naïve search for the nearest triangle has linear complexity, we accelerate the procedure by construction of a bounding sphere hierarchy with a special traversal algorithm as proposed by Sanchez et al [9]. In order to determine the sign of the minimal distance we follow the approach of Baerentzen and Aanaees [39] by using the angle-weighted pseudo-normal test which only requires the evaluation of a single dot product with a precomputed surface normal.…”

Virtual Sculpting and 3D Printing for Young People with Disabilities

“…Easy formulation allows us to work with traditional geometric primitives such as a sphere, box and cylinder. Beyond this, more complex geometric primitives such as polygonal meshes can be represented efficiently in the form of signed distance fields (Sanchez et al, 2012) which is a natural subset of FRep. Traditionally, the main disadvantage of such a representation is that the geometry of the object cannot be rendered using the common software for standard graphics hardware.…”