Advertisement

Journal of Computer Science and Technology

, Volume 25, Issue 3, pp 562–571 | Cite as

Harmonic Field Based Volume Model Construction from Triangle Soup

  • Chao-Hui Shen
  • Guo-Xin Zhang
  • Yu-Kun Lai
  • Shi-Min Hu
  • Ralph R. Martin
Article

Abstract

Surface triangle meshes and volume data are two commonly used representations of digital geometry. Converting from triangle meshes to volume data is challenging, since triangle meshes often contain defects such as small holes, internal structures, or self-intersections. In the extreme case, we may be simply presented with a set of arbitrarily connected triangles, a “triangle soup”. This paper presents a novel method to generate volume data represented as an octree from a general 3D triangle soup. Our motivation is the Faraday cage from electrostatics. We consider the input triangles as forming an approximately closed Faraday cage, and set its potential to zero. We then introduce a second conductor surrounding it, and give it a higher constant potential. Due to the electrostatic shielding effect, the resulting electric field approximately lies in that part of space outside the shape implicitly determined by the triangle soup. Unlike previous approaches, our method is insensitive to small holes and internal structures, and is observed to generate volumes with low topological complexity. While our approach is somewhat limited in accuracy by the requirement of filling holes, it is still useful, for example, as a preprocessing step for applications such as mesh repair and skeleton extraction.

Keywords

volume model triangle soup harmonic field representation conversion mesh repair 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Lorensen W E, Cline H E. Marching cubes: A high resolution 3D surface construction algorithm. In Proc. SIGGRAPH1987, Anaheim, USA, July 27-31, 1987, pp.163-169.Google Scholar
  2. [2]
    Ju T, Losasso F, Schaefer S, Warren J. Dual contouring of hermite data. In Proc. SIGGRAPH 2002, San Antonio, USA, July 21-36, 2002, pp.339-346.Google Scholar
  3. [3]
    Huang J, Yagel R, Filippov V, Kurzion Y. An accurate method for voxelizing polygon meshes. In Proc. 1998 IEEE Symposium on Volume Visualization, Research Triangle Park, USA, Oct. 24, 1998, pp.119-126.CrossRefGoogle Scholar
  4. [4]
    Oomes S, Snoeren P, Dijkstra T. 3D shape representation: Transforming polygons into voxels. In Proc. SCALE SPACE1997, Utrecht, The Netherlands, July 2-4, 1997, pp.349-352.Google Scholar
  5. [5]
    Frisken S F, Perry R N, Rockwood A P, Jones T R. Adaptively sampled distance fields: A general representation of shape for computer graphics. In Proc. SIGGRAPH 2000, New Orleans, USA, July 23-28, 2000, pp.249-254.Google Scholar
  6. [6]
    Ju T. Fixing geometric errors on polygonal models: A survey. J. Comput. Sci. Technol., 2009, 24(1): 19-29.CrossRefGoogle Scholar
  7. [7]
    Ju T. Robust repair of polygonal models. ACM Trans. Graph., 2004, 23(3): 888-895.CrossRefGoogle Scholar
  8. [8]
    Ju T, Baker M L, Chiu W. Computing a family of skeletons of volumetric models for shape description. Computer-Aided Design, 2007, 39(5): 352-360.CrossRefGoogle Scholar
  9. [9]
    Nooruddin F S, Turk G. Simpli¯cation and repair of polygonal models using volumetric techniques. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(2): 191-205.CrossRefGoogle Scholar
  10. [10]
    Nooruddin F S, Turk G. Interior/exterior classification of polygonal models. In Proc. VIS 2000, Salt Lake City, USA, Oct. 8-13, 2000, pp.415-422.Google Scholar
  11. [11]
    Zhang E, Turk G. Visibility-guided simplification. In Proc. VIS 2002, Boston, USA, Oct. 27-Nov. 1, 2002, pp.267-274.Google Scholar
  12. [12]
    Dachille F, Kaufman A E. Incremental triangle voxelization. In Proc. Graphics Interface 2000, Montreal, Canada, May 15-17, 2000, pp.205-212.Google Scholar
  13. [13]
    Andújar C, Brunet P, Ayala D. Topology-reducing surface simplification using a discrete solid representation. ACM Trans. Graph., 2002, 21(2): 88-105.CrossRefGoogle Scholar
  14. [14]
    Sigg C, Peikert R, Gross M. Signed distance transform using graphics hardware. In Proc. VIS 2003, Seattle, USA, October 19-24, 2003, pp.83-90.Google Scholar
  15. [15]
    Carr J C, Beatson R K, Cherrie J B, Mitchell T J, FrightWR, McCallum B C, Evans T R. Reconstruction and representation of 3D objects with radial basis functions. In Proc. SIGGRAPH2001, Los Angeles, USA, Aug. 12-17, 2001, pp.67-76.Google Scholar
  16. [16]
    Kazhdan M, Bolitho M, Hoppe H. Poisson surface reconstruction. In Proc. SGP 2006, Cagliari, Italy, June 26-28, 2006, pp.61-70.Google Scholar
  17. [17]
    Shen C, O'Brien J F, Shewchuk J R. Interpolating and approximating implicit surfaces from polygon soup. In Proc. SIGGRAPH 2004, Los Angeles, USA, Aug. 8-12, 2004, pp.896-904.Google Scholar
  18. [18]
    Griffiths D J, Inglefield C. Introduction to Electrodynamics. Prentice Hall, 1999.Google Scholar
  19. [19]
    Li X, Guo X, Wang H, He Y, Gu X, Qin H. Harmonic volumetric mapping for solid modeling applications. In Proc. SPM2007, Beijing, China, June 4-6, 2007, pp.109-120.Google Scholar
  20. [20]
    Kreyszig E. Advanced Engineering Mathematics. John Wiley, 2005.Google Scholar
  21. [21]
    Rosell J, Iniguez P. A hierarchical and dynamic method to compute harmonic functions for constrained motion planning. In Proc. IROS 2002, Lausanne, Switzerland, Sept. 30-Oct. 4, 2002, pp.2335-2340.Google Scholar
  22. [22]
    Grady L. Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 2006, 28(11): 1768-1783.CrossRefGoogle Scholar
  23. [23]
    Zhou Q Y, Ju T, Hu S M. Topology repair of solid models using skeletons. IEEE Transactions on Visualization and Computer Graphics, 2007, 13(4): 675-685.CrossRefGoogle Scholar

Copyright information

© Springer 2010

Authors and Affiliations

  • Chao-Hui Shen
    • 1
  • Guo-Xin Zhang
    • 1
  • Yu-Kun Lai
    • 2
  • Shi-Min Hu
    • 1
  • Ralph R. Martin
    • 2
  1. 1.Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  2. 2.School of Computer ScienceCardiff UniversityCardiffU.K

Personalised recommendations