| A Fast Hidden-line Removal Algorithm for 3-Dimensional Buildings |
| |
| 摘 要： | ＡＦＡＳＴＨＩＤＤＥＮ－ＬＩＮＥＲＥＭＯＶＡＬＡＬＧＯＲＩＴＨＭＦＯＲ３－ＤＩＭＥＮＳＩＯＮＡＬＢＵＩＬＤＩＮＧＳＱｉｎＫａｉｈｕａｉ；ＴｏｎｇＧｅｌｉａｎｇ；ＺｈａｎｇＮａｎ；ＣｈｅｎＤａｉｌｉｎ；ＬｉＹｕｎｇｕｉ；ＳｈｅｎＷｅｎｄｕＡＦＡＳＴＨＩ...
|
A FAST HIDDEN-LINE REMOVAL ALGORITHMFOR 3-DIMENSIONAL BUILDINGS |
| |
| Authors: | Qin Kaihuai TongGeliang Zhang Nan Chen Dailin Li Yungui Shen Wendu |
| |
| Affiliation: | Qin Kaihuai; TongGeliang; Zhang Nan;Chen Dailin; Li Yungui; Shen Wendu |
| |
| Abstract: | in this paper, a fast hidden-line removal method for 3D buildings , which is based on thesubtraction of a convex polygon from another one in linear time, is presented. Also, the facetscontaining holes are quickly divided into a lot of convex polygons, say, triangles and convexquadrilaterals. The algorithm for the polygon division runs in O( (k+1) (n-3)) , where n is thetotal number of the vertices of the merged loop of the facet, and k is the number of the concavevertices of the merged one. |
| |
| Keywords: | hidden-line elimination convex polygon building |
| 本文献已被 CNKI 等数据库收录！ |
