摘要
面基域的确定是从工程设计二维平面图进行三维模型重构工作中的一个重要步骤。首先介绍两个面基域划分算法思想:一种是基于平面拓扑结构的广度遍历支撑树,然后对支撑树进行遍历确定各个面基域;另一种是对一个节点的可见边进行旋转角度的有序排列,确定从一条边出发如何选择后继边以围成面基域,从而对图进行划分确定面基域。在比较这两种算法的优缺点的基础上,结合它们的优点得出一种新的综合算法思想。
It is a critical step during restoring the 3-D model from the 2-D design map to recognize it's subdivision. Two algorithms are introduced at first: the first algorithm is based on the sustaining tree of the map shaped during width_first_searching the map, visit the sustain and tree then determine the subdivision; the second keeps its eyes on how to choose a path when arrived at a node, namely after selecting a edge to choose its follow to construct a loop that encloses a subdivision. The principle is to sort the visible edges of the node according to the rotating angle of the edges. Comparting strongpoints of the two algorithms a new compositive method to analyse the subdivision of the map is presented.
出处
《计算机工程与设计》
CSCD
北大核心
2005年第1期69-71,共3页
Computer Engineering and Design
基金
国家自然科学基金项目(59978017)。
关键词
面基域
支撑树
可见边
平面图
subdivision
sustaining tree
visible edges
