An Algorithm for Voxelizing Non-manifold Triangle Geometry  

作　　者：ZHANG Lu-peng JIA Shi-yu WANG Ji-qiang 

机构地区：[1]College of Computer Science and Technology,Qingdao University

出　　处：《科技视界》2018年第4期82-83,95,共3页Science & Technology Vision

摘　　要：Taking advantage of the characteristic of distance field and octree, we brought up a method which can discrete any triangle-geometry into voxel. As many triangles used for cutting simulation are unoriented, non-manifold or self-intersecting, which leads to ambiguity in mathematical terms. The algorithm firstly computes sign distance field and use the threshold value to reconstruct the surface, which is very close to the original mode. At last, the reconstructed surface is voxelized. Also we can produce voxelized model which is suitable for cutting simulation.Taking advantage of the characteristic of distance field and octree, we brought up a method which can discrete any triangle-geometry into voxel. As many triangles used for cutting simulation are unoriented, non-manifold or self-intersecting, which leads to ambiguity in mathematical terms. The algorithm firstly computes sign distance field and use the threshold value to reconstruct the surface, which is very close to the original mode. At last, the reconstructed surface is voxelized. Also we can produce voxelized model which is suitable for cutting simulation.

关 键 词：DISTANCE field OCTREE NON-MANIFOLD Self-intersecting Triangle-geometry VOXELIZATION 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]