期刊文献+

线框模型投影图的消隐 被引量:2

Hidden line removal for wireframe projection drawing
下载PDF
导出
摘要 不具有表面信息的三维线框模型投影到二维平面上,不能利用现有的立体投影消隐的方法来消除被遮挡线。提出利用包围盒与有向三角形相结合的方法,找出投影图中的相交边,通过投影模型计算距离并判断其相互的遮挡关系。引入遮挡矩阵存储遮挡信息弥补了投影降维后造成的深度信息损失。利用遮挡矩阵更新表示顶点间拓扑关系的连接矩阵,得到不含隐藏线的投影图。实验表明,算法稳定而高效。 Since Wireframe does not have the face information,the hidden line of its projection drawing cannot be removed by the existing methods.In this paper,an efficient algorithm for removing the hidden line from wireframe projection drawing was presented.In projection drawing,the intersection of the two lines was identified by bounding box and directed triangle.Further,the visibility of intersection lines could be determined by projection model.The occlusion matrix made up for the lost depth information during projection.The connected matrix of topological relationships between vertices was renewed by occlusion matrix,and the projection drawing defined by connected matrix had no hidden line.The test results show the high efficiency and stability of the proposed algorithm.
出处 《计算机应用》 CSCD 北大核心 2010年第3期620-624,共5页 journal of Computer Applications
基金 国家自然科学基金重点资助项目(50875210) 兰州交通大学"青蓝"人才工程资助计划项目(QL-06-11A)
关键词 线框模型 投影图 隐藏线 线段相交 wireframe model projection drawing hidden line line segment intersection
  • 相关文献

参考文献7

  • 1MARKOWSKY G,WESLEY M A.Fleshing out wire frames[J].IBM Journal of Research and Development,1980,24(5):582-597.
  • 2LIU SHI-XIA,HU SHI-MIN,CHEN YU-JIAN,et al.Reconstruction of curved solids from engineering drawings[J].Computer Aided Design,2001,33(14):1059-1072.
  • 3SUGIHARA K.An intersection algorithm based on Delaunay triangulation[J].IEEE Computer Graphics and Application,1992,12(2):59-67.
  • 4BENTLEY J L,OTTMANN T A.Algorithms for reporting and counting geometric intersections[J].IEEE Transactions on Computers,1979,28(9):643-647.
  • 5王晓东,傅清祥,范庆,王梅集.线段相交问题的平面扫描型改进算法[J].计算机辅助设计与图形学学报,1996,8(2):87-94. 被引量:4
  • 6肖子枫,韩冀中,贺劲,韩承德.平面线段相交问题的渐缩规整包围盒过滤规则[J].计算机辅助设计与图形学学报,2008,20(10):1345-1352. 被引量:2
  • 7陈正鸣,李春雷.多边形链求交的改进算法[J].计算机辅助设计与图形学学报,2004,16(12):1713-1718. 被引量:15

二级参考文献24

  • 1陈正鸣,李春雷.多边形链求交的改进算法[J].计算机辅助设计与图形学学报,2004,16(12):1713-1718. 被引量:15
  • 2王晓东,傅清祥,范庆,王梅集.线段相交问题的平面扫描型改进算法[J].计算机辅助设计与图形学学报,1996,8(2):87-94. 被引量:4
  • 3王季,翟正军,蔡小斌.基于深度纹理的实时碰撞检测算法[J].计算机辅助设计与图形学学报,2007,19(1):59-63. 被引量:9
  • 4Sugihara K. An intersection algorithm based on Delaunay triangulation[J]. IEEE Computer Graphics and Application, 1992, 12(2): 59~67
  • 5Held M. On the Computational Geometry of Pocket Machining[M]. Berlin: Springer, 1991
  • 6Bentley J L, Ottmann T A. Algorithms for reporting and counting geometric intersections[J]. IEEE Transactions on Computers, 1979, 28(9): 643~647
  • 7Nievergelt J, Oreoarata F P. Plane-sweep algorithm for intersecting geometric figures[J]. Communications of the ACM, 1982, 25(10): 739~747
  • 8Vatti B R. A generic solution to polygon clipping[J]. Communications of the ACM, 1992, 35(7): 56~63
  • 9Park S C, Shin H. Polygonal chain intersection[J]. Computer & Graphics, 2002, 26(2): 341~350
  • 10Clarkson K L. Applications of random sampling in computational geometry [C] //Proceedings of the 4th Annual Symposium on Computational Geometry. Urbana-Champaign: ACM Press, 1988:1-11

共引文献17

同被引文献14

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部