TECHNIQUES FOR REDUCING PEN PLOTTING TIME

被引:7
作者
ANDERSON, DP [1 ]
机构
[1] UNIV WISCONSIN,DEPT COMP SCI,MADISON,WI 53706
来源
ACM TRANSACTIONS ON GRAPHICS | 1983年 / 2卷 / 03期
关键词
Data structures - Interactive computer graphics - Application programs - Human engineering;
D O I
10.1145/357323.357327
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The amount of time used by a pen plotter in drawing a set of line segments depends on the order and directions in which the segments are drawn, and can generally be reduced by reordering and redirecting the segments. This paper presents practical techniques for reducing plotting time. A method is proposed in which a buffer of segments is maintained, and the criterion used in choosing a segment from the buffer to draw is that of closeness to the current pen position. By storing the segment endpoints in a quadtree data structure, it is possible to find the closest endpoint in an amount of time which is essentially independent of the buffer size. We give algorithms for inserting, deleting, and finding closest points in the quadtree. The performance of the plotting time reduction program in a sample of real-world applications is given. Test cases from data plotting, computer-aided design and VLSI design are used. © 1983 ACM.
引用
收藏
页码:197 / 212
页数:16
相关论文
共 8 条
[1]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[2]  
BENTLEY JL, 1978, 16TH P ALL C COMM CO, P843
[3]  
Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933
[4]  
Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745
[5]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[6]   AN EFFECTIVE WAY TO REPRESENT QUADTREES [J].
GARGANTINI, I .
COMMUNICATIONS OF THE ACM, 1982, 25 (12) :905-910
[7]  
Nevalainen O., 1978, Angewandte Informatik, V20, P15
[8]  
STOCKER FR, 1980, APR SOC INF DISPL IN, P134