An Algorithm for Voxelizing Non-manifold Triangle Geometry
An Algorithm for Voxelizing Non-manifold Triangle Geometry作者机构：College of Computer Science and TechnologyQingdao University
出 版 物：《科技视界》 (Science & Technology Vision)
年 卷 期：2018年第4期
页 面：82-83,95页
学科分类：08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程]
主 题：Distance field Octree Non-manifold Self-intersecting Triangle-geometry Voxelization
摘 要：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.
维普期刊数据库
同方期刊数据库