Skip to main content
SpringerLink
Log in

General 3D offsetting of a triangular net using an implicit function and the distance fields

  • Published:
International Journal of Precision Engineering and Manufacturing Aims and scope Submit manuscript

Abstract

A novel approach which uses the distance fields based on cell subdivision and an implicit surface interpolation based on the radial basis function is proposed in order to get an accurate and error-free offset model of arbitrary shapes composed of a large number of triangle meshes. In the method, the space bounding the original model is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the proposed detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel, the distance fields are created by calculating the minimum distances between the corner points of voxels and the triangle meshes. For the more efficient calculation of distance fields, valid vertices among the triangle meshes which will generate minimum distances with current cell are selected by checking the intersection between current cell and a cone prism generated at each vertex of triangle meshes. In addition, a new approach based on an implicit surface interpolation scheme is proposed to perform two types of offsetting operations including uniform and non-uniform offsetting in the same framework. In the method, a smooth implicit surface is generated from the discrete offset distance values given by the user. After generating the whole distance fields, the offset surface was constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangle meshes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Farouki, R. T., “Exact offset procedures for simple solids,” Computer-aided Design, Vol. 2, No. 4, pp. 257–279, 1985.

    Article  Google Scholar 

  2. Satoh, T. and Chiyokura, H., “Boolean operations on sets using surface data,” Proc. of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, pp. 119–126, 1991.

  3. Forsyth, M., “Shelling and offsetting bodies,” Proc. of Third Symposium on Solid Modeling and Application, pp. 373–381, 1995.

  4. Kim, S. J. and Yang, M. Y., “Offset of STL Model Generated from Solid Model,” Journal of the Korean Society for Precision Engineering, Vol. 22, No. 9, pp. 202–211, 2005.

    Google Scholar 

  5. Jung, W. H., Jeong, C. S., Shin, H. Y. and Choi, B. K., “Extracting a Regular Triangular Net for Offsetting,” Journal of the Korean Society of CAD/CAM Engineers, Vol. 9, No. 3, pp. 203–211, 2004.

    Google Scholar 

  6. Koc, B. and Lee, Y. S., “Non-uniform offsetting and hollowing objects by using biarcs fitting for rapid prototyping processes,” Computers in Industry, Vol. 47, No. 1, pp. 1–23, 2002.

    Article  Google Scholar 

  7. Qu, X. and Stucker, B., “A 3D surface offset method for STL-format models,” Rapid Prototyping Journal, Vol. 9, No. 3, pp. 133–141, 2003.

    Article  Google Scholar 

  8. Yoo, D. J., “Offsetting of triangular net using distance fields,” Journal of the KSPE, Vol. 24, No. 9, pp. 148–157, 2007.

    Google Scholar 

  9. Mauch, S. P, “Efficient algorithms for solving static hamilton jacobi eguations,” Computational Geometry, Ph. D thesis, California Institute of Technology, 2003.

  10. Sigg, C., Peikert, R. and Gross, M., “Signed distance transform using graphics hardware,” Proc. of IEEE Visualization, pp. 83–90, 2003.

  11. Barentzen, J. A. and Aanas, H., “Signed distance computation using the angle weighted pseudo-normal,” IEEE Transactions on Visualization and Computer Graphics, Vol. 11, No. 3, pp. 243–253, 2005.

    Article  Google Scholar 

  12. Gueziec, A., “Meshsweeper: Dynamic point-to-polygonal mesh distance and applications,” IEEE Transactions on Visualization and Computer Graphics, Vol. 7, No. 1, pp. 47–60, 2001.

    Article  Google Scholar 

  13. Sud, A., Otaduy, M. A. and Manocha, D., “DiFi: Fast 3D distance field computation using graphics hardware,” Proc. of Euro-graphics, Vol. 23, No. 3, pp. 557–566, 2004.

    Google Scholar 

  14. Frisken, S. F., Perry, R. N., Rockwood, A. P. and Jones, T. R., “Adaptively sampled distance fields: a general representation of shape for computer graphics,” Proc. of the 27th Annual Conference on Computer Graphics and Interactive Techniques, pp. 249–254, 2000.

  15. Huang, J., Li, Y., Crawfis, R., Lu, S. C. and Liou, S. Y., “A complete distance field representation,” Proc. of Visualization, pp. 247–254, 2001.

  16. Turk, G. and O’Brien, J. F., “Modelling with implicit surfaces that interpolate,” ACM Transactions on Graphics, Vol. 21, No. 4, pp. 855–873, 2002.

    Article  Google Scholar 

  17. Carr, J. C., Beatson, R. K., Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C. and Evans, T. R., “Reconstruction and representation of 3D objects with radial basis functions,” Proc. of the 28th Annual Conference on Computer Graphics and Interactive Techniques, pp. 67–76, 2001.

  18. Kojekine, N., Hagiwara, I. and Savchenko, V., “Software tools using CSRBFs for processing scattered data,” Computer & Graphics, Vol. 27, No. 2, pp. 311–319, 2003.

    Article  Google Scholar 

  19. Yoo, D. J., “A Study on Filling Holes of the Polygon Model using Implicit Surface Scheme,” Journal of the Korean Society for Precision Engineering, Vol. 22, No. 3, pp. 107–114, 2005.

    MathSciNet  Google Scholar 

  20. Ohtake, Y., Belyaev, A., Alexa, M., Turk, G. and Seidel, H. P., “Multi-level partition of unity implicits,” ACM Transactions on Graphics(TOG), Vol. 22, No. 3, pp. 463–470, 2003.

    Article  Google Scholar 

  21. Yoo, D. J., “Shape Reconstruction from Unorganized Cloud of Point using Adaptive Domain De-composition Method,” Journal of the KSPE, Vol. 23, No. 8, pp. 89–99, 2006.

    Google Scholar 

  22. Yoo, D. J., “Shape Reconstruction from Large Amount of Point Data using Repetitive Domain Decomposition Method,” Journal of the KSPE, Vol. 23, No. 11, pp. 93–102, 2006.

    Google Scholar 

  23. Yoo, D. J., “Filling Holes in Large Polygon Models Using an Implicit Surface Scheme and the Domain Decomposition Method,” IJPEM, Vol. 8, No. 1, pp. 3–10, 2007.

    Google Scholar 

  24. Yoo, D. J., “Automatic Generation of the Input Data for Rapid Prototyping from Unorganized Point Cloud Data,” Journal of the KSPE, Vol. 24, No. 11, pp. 144–153, 2007.

    Google Scholar 

  25. Wang, Y., “Periodic surface modeling for computer aided nano design,” Computer-Aided Design, Vol. 39,Issue 3, pp.179–189, 2007.

    Article  Google Scholar 

  26. Jung, Y., Chu, K. T. and Torquato, S., “A variational level set approach for surface area minimization of triply-periodic surfaces,” Journal of Computational Physics, Vol. 223,Issue 2, pp. 711–730, 2007.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Aided Mechanical Design Engineering, Daejin University, Pocheon-Si, Kyeonggi-Do, South Korea, 487-711

    Dong-Jin Yoo

Authors
  1. Dong-Jin Yoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dong-Jin Yoo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yoo, DJ. General 3D offsetting of a triangular net using an implicit function and the distance fields. Int. J. Precis. Eng. Manuf. 10, 131–142 (2009). https://doi.org/10.1007/s12541-009-0081-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12541-009-0081-5

Keywords

Search

Navigation