摘要
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.
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.
