Adaptively Represented Complete Distance Fields of Polygonal Models

  • Jian Huang
  • Roger Crawfis
Conference paper
Part of the Mathematics and Visualization book series (MATHVISUAL)

Summary

Distance fields are an important volume representation. However, distance fields constructed by straightforward discrete sampling can neither provide a quantitative measure of error nor fully capture detailed distance fields caused by corners in 3D geometries. We discuss here a complete distance field representation (CDFR) of polygonal models that does not rely on Nyquist sampling theory. In a CDFR volume, each voxel has a complete description of all surface polygons that affect the local distance field. CDFR can be adaptively represented without compromising accuracy. The adaptively represented complete distance field is shorted for ARCDF. For any desired distance, we can extract a surface contour in Euclidean distance, at any levels of accuracy, from the same CDFR or ARCDF representation. We further show any example of applying CDFR to a cutting edge CAD application involving high-complexity parts at un-precedented accuracy using only commonly available computational resources. Finally, although the general concepts presented here may be extended for parametric models as well, our current method can only handle polygonal models.

Keywords

Engine Cylinder Polygonal Mesh Distance Field Polygonal Model Volume Visualization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Breen, S. Mauch and R. Whitaker, 3D scan conversion of CSC models into distance volumes, Proc. 1998 IEEE Symposium on Volume Visualization, pp. 7–14, 1998.Google Scholar
  2. 2.
    D.E. Breen, S. Mauch, R.T. Whitaker and J. Mao, 3D Metamorphosis Between Different Types of Geometric Models, Eurographics 2001 Proceedings, September 2001, pp. 36–48.Google Scholar
  3. 3.
    D. Breen, R. Whitaker, A Level Set Approach for the Metamorphosis of Solid Models, IEEE Trans. on Visualization and Computer Graphics, 2001, vol. 7, No. 2, pp. 173–192.CrossRefGoogle Scholar
  4. 4.
    H. Cline, W. Lorensen, S. Ludke, C. Crawford, B. Teeter, Two algorithms for the three-dimensional reconstruction of tomograms, Medical Physics, 15(3), May/June, 1988, pp. 320–327.Google Scholar
  5. 5.
    D. Cohen-Or, D. Levin, and A. Solomovici, Three-dimensional distance field metamorphosis, ACM Transactions on Graphics, Vol. 17, No. 2, pp. 116–141, April 1998.Google Scholar
  6. 6.
    H. Pfister, J. Barr, M. Zwicker, M. Gross, Surfel: surface elements as rendering primitives, Proc. of Siggraph 2000, New Orleans, 2000.Google Scholar
  7. 7.
    S. Frisken, R. Perry, A. Rockwood, T. Jones, Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics, Proc. of SIGGRAPH 2000, New Orleans, LA, July, 2000.Google Scholar
  8. 8.
    A. Gueziec, Meshsweeper: dynamic point-to-polygonal mesh distance and applications, IEEE Transactions on visualization and computer graphics, vol. 7, no. 1, pp. 47–61, Jan–Mar, 2001.Google Scholar
  9. 9.
    S. Gibson, Using Distance Maps for smooth surface representation in sampled volumes, Proc. 1998 IEEE Volume Visualization Symposium, pp. 23–30, 1998.Google Scholar
  10. 10.
    W. Lorensen, H. Cline, Marching Cubes: a high resolution 3D surface construction algorithm, Computer Graphics (SIGGRAPH 87 Proceedings), 1987, 163–169.Google Scholar
  11. 11.
    J. Huang, R. Yagel, V. Fillipov, Y. Kurzion, An Accurate Method to Voxelize Polygonal Meshes, Proc. of IEEE/ ACM Symposium on Volume Visualization, October, 1998, Chapel Hill, NC.Google Scholar
  12. 12.
    J. Huang, K. Mueller, N. Shareef, R. Crawfis, FastSplats: optimized splatting on rectilinear grids, Proc. of IEEE Conference on Visualization, October, 2000, Salt Lake City, UtahGoogle Scholar
  13. 13.
    J. Huang, Y. Li, R. Crawfis, S. Lu, S. Liou, A Complete Distance Field Representation, Proc. of IEEE Conference on Visualization, October, 2001, San Diego, CA.Google Scholar
  14. 14.
    D.E. Johnson and E. Cohen, A framework for efficient minimum distance computations, Proc. IEEE Intl. Conf. Robotics Automation, 1998, pp. 36783684.Google Scholar
  15. 15.
    A. Kaufman, An algorithm for 3D scan-conversion of parametric curves, surfaces, and volumes, Proc. of SIGGRAPH 87, pp. 171–179, July, 1987.Google Scholar
  16. 16.
    S. Lu, A. Rebello, R. Miller, G. Kinzel, R. Yagel, A simple visualization tool to support concurrent engineering design, Journal of Computer-Aided Design, Vol. 29, No. 10, pp. 727–735.Google Scholar
  17. 17.
    B. Payne, A. Toga, Distance Field Manipulation of Surface Models, IEEE Computer Graphics and Applications, vol. 12, No. 1, 1992, pp. 65–71.MATHCrossRefGoogle Scholar
  18. 18.
    H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.Google Scholar
  19. 19.
    R. Yagel, S. Lu, A. Rubello, R. Miller, Volume-based reasoning and visualization of dicastability In Proc. IEEE Visualization 95, pp. 359–362, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jian Huang
    • 1
  • Roger Crawfis
    • 2
  1. 1.Computer ScienceThe University of TennesseeKnoxvilleUSA
  2. 2.Computer and Information ScienceThe Ohio State UniversityColumbusUSA

Personalised recommendations