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

两凸平面相贯立体的隐藏线消去法
引用本文:陈旭 ,魏任之.两凸平面相贯立体的隐藏线消去法[J].南京航空航天大学学报,1988(4).
作者姓名:陈旭  魏任之
摘    要:本文介绍了一种消去两相贯凸平面立体的隐藏线算法。首先利用外法线法单体消隐,然后用线与面比较法作组合消隐计算,逐一确定各个单体上可见棱线在组合体上的可见线段,最后显示或绘制所有的可见棱线段和两体的可见交线,得到消隐后的立体图。本法信息输入量较小,功能较强,不但适用于两相贯的凸平面立体的消隐,而且也适用于两迭加的凸平面立体的消隐。本程序还适用于两体具有共面的情况。

关 键 词:计算机制图  算法  程序语言  消隐

An Algorithm for Removing Hidden Lines of Two Intersected Convex Solids
Chen Xu Wei Renzhi.An Algorithm for Removing Hidden Lines of Two Intersected Convex Solids[J].Journal of Nanjing University of Aeronautics & Astronautics,1988(4).
Authors:Chen Xu Wei Renzhi
Institution:Chen Xu Wei Renzhi
Abstract:An algorithm for removing hidden lines formed by two intersected convex solids is presented in this paper. Hidden lines on the single solid are first removed according to the direction of the outward normal vector, then lines and planes are compared to determine the visible line segments of the visible edges of every single solid so as to complete the hidden line calculation on the complex. All the visible edge segments and the visible intersection lines of two solids are displayed or drawn to obtain the axonometric projections after removing hidden lines. The algorithm needs less input information, and has many functions. It can be used not only in the case of two intersected convex solids, but also in the case of two overlapped convex solids, and two solids with common surface.
Keywords:computer cartography  algorithm  programming languages  removing hidden lines  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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