ELIMINATING HIDDEN EDGES IN LINE DRAWINGS

被引:10
作者
GRIFFITHS, JG
机构
[1] Department of Mathematics, University of Salford, Salford
关键词
D O I
10.1016/0010-4485(79)90099-X
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A short efficient algorithm for displaying unshaded line drawings with the hidden edges removed is described. The objects drawn have plane or nearly plane simply connected polygonal faces which do not intersect except at a shared edge. A lookup technique is used to find the faces that might hide a given edge. The computation time is almost proportional to the complexity of the object. A simple subroutine package for building the definitions of complex objects is also described. © 1978.
引用
收藏
页码:71 / 78
页数:8
相关论文
共 16 条
[1]  
Griffiths, Bibliography of hidden-line and hidden-surface algorithms, Computer-Aided Design, 10, 3, pp. 203-206, (1978)
[2]  
Appel, The notion of quantitative invisibility and the machine rendering of solids, Proc. 22nd ACM Nat. Conf., pp. 387-393, (1967)
[3]  
Cleveland, Hidden line elimination for 3-D graphical objects, MSc thesis, (1973)
[4]  
Griffiths, Drawing opaque solids using an incremental plotter, The Computer Journal, 16, 1, pp. 35-38, (1973)
[5]  
Loutrell, A solution to the hidden line problem for computer drawn polyhedra, IEEE Transactions on Computers, 19 C, 3, pp. 205-213, (1970)
[6]  
Appel, The visibility problem and the machine rendering of solids, IBM Res. Rep. RC-16-18, (1966)
[7]  
Galimberti, Montanari, An algorithm for hidden line elimination, Communications of the ACM, 12, 4, pp. 206-211, (1969)
[8]  
Kubert, Szabo, Gulieri, The perspective representation of functions of two variables, Journal of the ACM, 15, 2, pp. 193-204, (1968)
[9]  
Ricci, An algorithm for the removal of hidden lines in 3-D scenes, The Computer Journal, 14, pp. 375-377, (1971)
[10]  
Griffiths, Drawing pictures of solid objects using a graph plotter, Comput. Aided Des., 5, 1, pp. 14-21, (1973)