| Calculating arbitrary point in space to a given arbitrary polyhedral signed minimum distance has applications in many engineering fields. In recent years, computer graphics,computer simulation and other related fields, with a distance field indicates the target graphic STLect has been widely used. E.g., collision detection, estimation extraction,texture mapping, three-dimensional STLect deformation. We often say that the distance field is actually a scalar field, it represents an arbitrary point in three-dimensional space to a minimum distance value for a given three-dimensional surface of the STLect. In computer graphics, commonly used are signed distance field, the symbol indicates the position of the point in the interior of the body or in an external STLect. In most cases,the field value is positive when the distance field indicates the point is outside the three-dimensional STLect; the distance field indicates the field value is negative when the point is located inside the three-dimensional STLect; the distance field value of zero indicates that the field is located in the three-dimensional surface of the STLect point.This article describes three on three-dimensional STLects have to distance field generation algorithm, namely a brute force algorithm to calculate the distance field is generated, based on space partitioning algorithm to generate single-threaded distance field and space-based segmentation algorithm multi-threaded distance field is generated.Details of the distance field generation process model relating STL file import and processing, spatial division of thought from the field of storage, and distance field symbol judgment. The results compare three algorithms, we can see that generate spatial segmentation algorithm based on multi-threaded distance field with respect to the other two algorithms not only save a lot of storage space, while in the distance field production rate has greatly improved, especially for complex models. |
PDF Full Text Request