抄録
When we voxelize a polygon model, we have to check all the voxels in the computational domain whether they are inside or outside of the model. A large number of voxels makes the voxelization cost high. In recent years, the number of vertices in a polygon model is increasing. So efficient voxelization from a large polygon model is a challenging topic. In this paper, a realtime solid voxelization method is proposed. Our method voxelizes a polygon model with tens of thousands of vertices to voxel data less than one second. The polygon model is converted into a set of layered depth images which are independent of model complexity. At the same time, the orientation of polygons are also extracted. In general, a ray traversal method is used in voxelization phase, which counts the number of times hitting a polygon to determine voxel properties. We propose a short ray traversal method, which divides a ray to a set of short rays which go through the volume in parallel. Our method needs not to count the number of hitting times and can check the voxel without any global information. Therefore, the computational cost of short ray traversal has no relation to model complexity. We also propose two optimization methods which compute the unnecessary region of the bounding box for skipping some calculations. These techniques accelerate voxelization.
