Techniques for Reducing Pen Plotting Time

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Techniques for Reducing Pen Plotting Time

Full text

Pdf (726 KB)

Source

ACM Transactions on Graphics (TOG) archive
Volume 2 , Issue 3 (July 1983) table of contents

Pages: 197 - 212

Year of Publication: 1983

ISSN:0730-0301

Author

D. P. Anderson

Computer Sciences Dept., University of Wisconsin at Madison, Madison, WI

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 23, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/357323.357327 What is a DOI?

Warning: The download time has expired please click on the item to try again.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975 [doi>10.1145/361002.361007]
	2	BENTLEY, J.L., WEIDE, B.W., AND YAO, A.C. Optimal expected-time algorithms for closest-point problems. In Proc. Sixteenth Annual Allerton Conference on Communications, Control and Computing. Monticello, Ill., Oct. 4-6, 1978), Univ. of Illinois at Urbana, pp. 843-851.
	3	FINKEL, R.A. AND BENTLEY, J.L. Quad treesla data structure for retrieval on composite keys. Act Inf. 4, 1 (Jan. 1974), 1-9.
	4	Jerome H. Freidman , Jon Louis Bentley , Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.209-226, Sept. 1977 [doi>10.1145/355744.355745]
	5	GAREY, M.R. AND JOHNSON, D.S. Computers and Intractability. W.H. Freeman and Co., San Francisco, 1979.
	6	Irene Gargantini, An effective way to represent quadtrees, Communications of the ACM, v.25 n.12, p.905-910, Dec 1982 [doi>10.1145/358728.358741]
	7	NEVALAINEN, O. AND VESTERINEN, M. Solving the order of line drawing. Angew. Inf. 20, 1 (Jan. 1978), 15-19.
	8	STOCKER, F.R., JOHNSON, G.G. AND MCKINSTRY, H.A. Optimization techniques for drawing computer graphics displays. Digest of Technical Papers, Society for Information Display International Symposium, (San Diego, Ca., April 1980), pp. 134-135.

CITED BY 3

	Dennis Shasha , Tsong-Li Wang, New techniques for best-match retrieval, ACM Transactions on Information Systems (TOIS), v.8 n.2, p.140-158, Apr. 1990
	Hanan Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys (CSUR), v.16 n.2, p.187-260, June 1984
	Hanan Samet , Robert E. Webber, Hierarchical Data Structures and Algorithms for Computer Graphics. Part I., IEEE Computer Graphics and Applications, v.8 n.3, p.48-68, May 1988