In this paper, a fast algorithm to extract surface boundary is proposed on the basis of the triangular mesh data. Boundary stack is constructed, and all boundary index push back into the boundary stack and an empty boundary pool are initialized. One boundary index is popped up from the boundary stack and compared with all indexes in the boundary pool. If there is same one boundary index that is viewed as inner boundary, then it deletes it from boundary pool, else, makes it stay in pool. It repeats the above steps until the boundary stack is empty, and the process of boundary detection is finished. The boundary is stayed in boundary pool. Experimental results show that the new algorithm is simple to implement, and has high computing efficiency.%针对三角网格数据,提出一种边界提取的快速算法.建立边栈,将所有边索引压入边栈中,并初始化一个空的边池.从边栈中弹出一个边索引与池中的所有边索引进行比较,如果2条边索引相同则视该边为内边,从池中删除；否则留在池中.继续执行该过程,直到边栈为空,结束边界提取,边池中的边即边界边.实验结果表明,该算法易于实现,具有较高的计算效率.
展开▼
