基于空间连通性的快速曲面重建算法  

Fast Reconstruction of Surface Based on Spatial Connectivity

作　　者：熊邦书[1] 何明一[1] 俞华璟[1] 

机构地区：[1]西北工业大学电子信息学院

出　　处：《系统仿真学报》2005年第1期75-78,共4页Journal of System Simulation

基　　金：国家自然科学基金(60172040)江西省测试技术与控制工程研究中心开放基金(2002-14)。

摘　　要：为提高用标准移动立体法进行等值面提取的速度,提出了一种改进算法。算法利用体元的空间连通关系,实现只访问和处理那些与等值面相交的体元;采用缓存技术记录已处理过体元的顶点信息,避免了重复计算,从而提高了重建的效率。文中还给出了接近于最佳搜索k-近邻速度的空间分块方法,大大提高了散乱数据点的处理效率。应用实例说明,算法的效果良好。An exhaustive searching all the cells in a 3D dataset decreases the efficiency of surface reconstruction when the standard Marching Cubes (MC) algorithm is used to extract the isosurface from unorganized points. An extended marching cubes algorithm is proposed. The algorithm can more efficiently extract the isosurface based on the spatial connectivity of cells and hence 'marching' only into the cells that contain the surface. Using cache technology, by which the evaluated signed distance from vertices of the cell to the isosurface are saved and copied into its neighboring cells, can improve the efficiency of the algorithm. The spatial partitioning method with a nearly optimal speed of searching k-nearest neighbors, which is put forward in the paper, improves greatly the processing speed of points. The experimental results show that the proposed algorithm is effective.

关 键 词：曲面重建 移动立方体 三角划分 空间连通性 

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