Advertisement

Voxelizating 3D mesh models with gray levels

  • Wei Liu (柳 伟)Email author
  • Yuan-jun He (何援军)
  • Xiong-hui Zhou (周雄辉)
Article

Abstract

A novel algorithm to voxelize 3D mesh models with gray levels is presented in this paper. The key innovation of our method is to decide the gray level of a voxel according to the total area of all surfaces contained by it. During the preprocessing stage, a set of voxels in the extended bounding box of each triangle is established. Then we travel each triangle and compute the areas between it and its set of voxels one by one. Finally, each voxel is arranged a discrete gray level from 0 to 255. Experiments show that our algorithm gets a comparatively perfect result compared with the prevenient ones and approaches the original models in a more accurate way.

Key words

voxelization gray levels intersectant area 3D model 

CLC number

TP 391 

References

  1. [1]
    Greene N. Voxel space automata: Modeling with stochastic growth processes in voxel space [J]. Computer Graphics, 1989, 23(3): 175–184.CrossRefMathSciNetGoogle Scholar
  2. [2]
    Agel R, Cohen D, Kaufman A. Discrete ray tracing [J]. IEEE Computer Graphics and Applications, 1992, 12(5): 19–28.CrossRefGoogle Scholar
  3. [3]
    Vranic V, Saupe D. 3D shape descriptor based on 3D Fourier transform [C]//Proceedings of the EURASIP Conference on Digital Signal Processing for Multimedia Communications and Services. Budapest: IEEE Press, 2001: 271–274.Google Scholar
  4. [4]
    Kaufman A, Shimony E. 3D scan-conversion algorithms for voxel-based graphics [C]//Proceeding of ACM Workshop on Interactive 3D Graphics. Chapel Hill: ACM Press, 1986: 45–76.Google Scholar
  5. [5]
    Wu X, Liu W, Wang T. Octree structure based voxelization of polygonal meshes [J]. Journey of Engineering Graphics, 2005, 26(4): 1–7.Google Scholar
  6. [6]
    Huang J, Roni Y, Vassily F. An accurate method for voxelizing polygon meshes [C]//Proceeding of IEEE Symposium on Volume Visualization. Austin: IEEE Press, 1998: 119–126.CrossRefGoogle Scholar
  7. [7]
    David B, Sean M, Ross W. 3D scan conversion of CSG models into distance volumes [C]//Proceedings of Symposium on Volume Visualization. Seattle: ACM Press, 1998: 7–14.Google Scholar
  8. [8]
    Voorhies D. Triangle-cube intersection [C]// Graphics Gems III. [s.l.]: Academic Press, 1992: 236–239.Google Scholar
  9. [9]
    Green D, Hatch D. Fast polygon-cube intersection testing [C]// Graphics Gems V. [s.l.]: Academic Press, 1995: 375–379.Google Scholar
  10. [10]
    Tomas A. Fast 3D triangle-box overlap testing [J]. Journal of Graphics Tools, 2001, 6(1): 29–33.MathSciNetGoogle Scholar
  11. [11]
    Michael G. QSlim simplification[EB/OL]. [2004-01-01]. http://graphics.cs.uiuc.edu/garland/software/qslim.html.

Copyright information

© Shanghai Jiaotong University and Springer Berlin Heidelberg 2009

Authors and Affiliations

  • Wei Liu (柳 伟)
    • 1
    Email author
  • Yuan-jun He (何援军)
    • 2
  • Xiong-hui Zhou (周雄辉)
    • 1
  1. 1.National Die and Mold CAD Engineering Research CenterShanghai Jiaotong UniversityShanghaiChina
  2. 2.Department of Computer Science and EngineeringShanghai Jiaotong UniversityShanghaiChina

Personalised recommendations