陈益林, 杨茂奎, 张桂梅. 一种新的立体线图标记算法[J]. 南昌航空大学学报(自然科学版), 2004, 18(1): 94-98.
引用本文: 陈益林, 杨茂奎, 张桂梅. 一种新的立体线图标记算法[J]. 南昌航空大学学报(自然科学版), 2004, 18(1): 94-98.
CHEN Yi-lin, YANG Mao-kui, ZHANG Gui-mei. A New Labeling Algorithm for Line Drawings[J]. Journal of nanchang hangkong university(Natural science edition), 2004, 18(1): 94-98.
Citation: CHEN Yi-lin, YANG Mao-kui, ZHANG Gui-mei. A New Labeling Algorithm for Line Drawings[J]. Journal of nanchang hangkong university(Natural science edition), 2004, 18(1): 94-98.

一种新的立体线图标记算法

A New Labeling Algorithm for Line Drawings

  • 摘要: 根据投影理论给出了遮挡棱的判断规则,基于该规则提出了一种新的立体线图标记算法.在该算法中标记的传播是由遮挡棱向非遮挡棱传播.实验结果表明该算法是有效的.这种标记算法可排除许多不可能的场景结构,正确标记出符合人们画图习惯的立体线图,使得计算机能够模拟人的思维正确地理解和解释投影线图.

     

    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.

     

/

返回文章
返回