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

基于二维排序和平面加厚技术的自由曲面消隐算法
引用本文:黄胜芳.基于二维排序和平面加厚技术的自由曲面消隐算法[J].北京航空航天大学学报,1994,20(2):220-228.
作者姓名:黄胜芳
作者单位:北京航空航天大学宇航学院
摘    要:消除隐藏线是计算机真实感显示的一项重要,自由曲面的消隐则是其中的难点,本文提出的自由曲面消隐算法提出了平面加厚技术和二维排序技术,给出一块三角曲面片,加厚技术就是用加厚三角形所得的三角砖来逼近曲面片,采用二维排序技术,光栅点的可见性判定归结为矩形域在排序表中的查询,测试表明,本算法较传统算法提高速度两个数量级以上,消隐时间随光栅点线性增长,光栅点最多可达62000个(对于640K内存)。

关 键 词:制图  排序  射影  平面加厚技术

RESEARCH ON HIDDEN-LINE ALGORITHM FOR CURVED SURFACE BASED ON PLANE-THCKENING AND 2D-SORTING
Huang,Shengfang.RESEARCH ON HIDDEN-LINE ALGORITHM FOR CURVED SURFACE BASED ON PLANE-THCKENING AND 2D-SORTING[J].Journal of Beijing University of Aeronautics and Astronautics,1994,20(2):220-228.
Authors:Huang  Shengfang
Institution:Beijing University of Aeronautics and Astronautics.School of Astronautics
Abstract:A fast and robust hidden-line algorithm for free surface is presented which uses both plane-thickening and 2D-sorting techniques toeliminate the hidden-lines.Given a piece of triangle sulface.thickening techinque is replacing surface pieces with triangle bricks which are produced by thickening triangles.Exploiting 2D-sorting technique.the visibility determination of the grid points can be identified as an orthogonal range query in a 2D-sorted table.As shown by test results.the processing speed is hundreds of times higher than that of traditional ones.and far beyonds the advanced world level.The time cost depends linearly on the density of the grid points.The number of the grid points is up to 62000(for 640K core memory).The algorithm can also be applied to produce the shaded image.
Keywords:drawing  sequencing  elimination  project  decomposition  plane-thickening
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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