三维重建过程中连通区域求解算法研究

A Study on the Algorithm for Solving the Connected Areas on the 3D Reconstruction

工程图的三维重建算法中二维视图特征识别是重建的关键,一般采用求解连通区域的技术来识别视图特征.针对视图特征的识别研究了传统的以图元为中心的连通区域求解算法,提出了以图元端点为中心的连通区域求解算法,将图元的多次遍历转换成一次遍历并建立端点链表的过程,减少了求解连通区域过程中的虚假连通信息,提高了连通区域的求解的效率.

The feature recognition of the 2D view in the 3D reconstruction algorithm for engineering drawing is an important key issues. The method of recognition of view＇s feature is based on the solving the connected areas. Aiming at the recognition of the view＇s feature, an traditional algorithm for solving the connected areas taking the drawing element as a center is studied. And at the same time, a new algorithm for solving the connected areas taking the drawing element end as a center is put forward. In this new algorithm, the multiple traversing of the drawing elements is converted into one-time traversing, and the linkage-list of the ends is established, thus the efficiency for solving the connected areas is increased.