FAST DISPLAY OF WELL-TESSELATED SURFACES

被引:7
作者
BROWN, CM
机构
[1] Computer Science Department, The University of Rochester, Rochester
关键词
D O I
10.1016/0097-8493(79)90010-4
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Well-tesselated surfaces are piecewise planar functions on the sphere. Their planar faces are triangles which must meet a local geometric constraint. The faces may have arbitrary properties of transparency or reflectivity. These surfaces admit of simple hidden-line and -surface algorithms. In a raster graphics environment, the algorithms yield a priority ordering for painting entire faces. This order depends only upon the 3-D directions of face vertices as seen from the origin, and is independent of the radial position of vertices. Hence the order is independent of the actual function realized by the surface. Since perspective distortion and an approximate version of object rotation may both be accomplished by changing only radial vertex positions, these useful transformations may be visualized without resorting. Specific methods for creating well-tesselated surfaces are given, and general constraints defining them are stated. An efficient hidden surface/line algorithm is presented, with a simpler method for the case of opaque faced polyhedra. Proofs of correctness are provided. © 1979.
引用
收藏
页码:77 / 85
页数:9
相关论文
共 9 条
[1]  
Fuller, Building construction, (1951)
[2]  
Sutherland, Sproull, Schumacker, A characterization of ten hidden-surface algorithms, ACM Computing Surveys, 6, 1, pp. 1-55, (1974)
[3]  
Newell, Newell, Sancha, A new approach to the shaded picture problem, Proceedings of ACM National Conference, (1972)
[4]  
Coxeter, Regular Polytypes, (1973)
[5]  
Brown, Representing the orientation of dendritic fields with geodesic tesselations, TR13, (1977)
[6]  
Clinton, Advanced structural geometry studies part I: polyhedral subdivision concepts for structural applications, (1971)
[7]  
Brown, Two descriptions and a two-sample test for 3-D vector data, TR49, (1979)
[8]  
Preparata, Muller, Finding the intersection of a set of n half-spaces in time 0(n log n), University of Illinois Report R-803 (ACT-7), (1977)
[9]  
Fuchs, Kedem, Uselton, Optimal surface reconstruction from planar contours, Communications of the ACM, 20, 10, pp. 703-712, (1977)