首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种新的立体线图标记算法
引用本文:陈益林,杨茂奎,张桂梅.一种新的立体线图标记算法[J].南昌航空工业学院学报,2004,18(1):94-98.
作者姓名:陈益林  杨茂奎  张桂梅
作者单位:[1]张家界航空工业职业技术学院,湖南张家界427000 [2]北工业大学,陕西西安710072 [3]南昌航空工业学院,江西南昌330034
摘    要:根据投影理论给出了遮挡棱的判断规则,基于该规则提出了一种新的立体线图标记算法。在该算法中标记的传播是由遮挡棱向非遮挡棱传播。实验结果表明该算法是有效的。这种标记算法可排除许多不可能的场景结构,正确标记出符合人们画图习惯的立体线图,使得计算机能够模拟人的思维正确地理解和解释投影线图。

关 键 词:线图  标记算法  遮挡棱
文章编号:1001-4926(2004)01-0094-04
收稿时间:2003-11-24
修稿时间:2003年11月24

A New Labeling Algorithm for Line Drawings
CHEN Yi-lin, YANG Mao-kui, ZHANG Gui-mei.A New Labeling Algorithm for Line Drawings[J].Journal of Nanchang Institute of Aeronautical Technology(Natural Science Edition),2004,18(1):94-98.
Authors:CHEN Yi-lin  YANG Mao-kui  ZHANG Gui-mei
Abstract:In this paper, a new method of labeling line drawing is proposed based on relations between L- junctions and W,Y- junctions. The labeling process in line drawings is from covered lines to uncovered lines. Some rules for judging covered lines are established based on the projective theory. Our labeling algorithm can discriminate between correct and incorrect hidden- part- draw natural line drawings by judging whether labeling of trihedral vertices is reasonable junctions or not. The effectiveness of the algorithm is demonstrated by the experiment. This algorithm makes computers easily understand and interpret line drawings.
Keywords:Line drawing  Labeling algorithm  Covered lines
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号