检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《工程图学学报》2009年第2期54-62,共9页Journal of Engineering Graphics
基 金:西北工业大学青年教师基金资助项目(M016219)
摘 要:列举和提出从画隐线图识别面的一系列基本定理和推论。介绍凸凹多边形的判别算法。给出从画隐线图搜索所有简单回路的递归算法,在搜索画隐线图的回路时,利用基本定理和相关推论对真正面进行定性判断,并对回路集合进行修枝。提出从平面立体画隐线图识别面的算法。算例表明算法能正确识别平面立体画隐线图中的真正面。Face identification is a key step to the 3D reconstruction from a single 2D line drawing. Some of elementary theorems and interrelated deductions are proposed to make certain real faces as searching cycles and help to automatically delete a set of cycles that are not real faces. A recursion-based algorithm for searching for all of cycles and identifying faces from the cycles is given from a line drawing with hidden-parts-drawn. This method is applied to objects with planar faces. The experimental results show that the algorithm is reliable.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28