article

Free access

Techniques for Reducing Pen Plotting Time

Editor: R. Daniel Bergeron Author:

D. P. AndersonAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 2, Issue 3

Pages 197 - 212

https://doi.org/10.1145/357323.357327

Published: 01 July 1983 Publication History

PDF eReader

References

[1]

BENTLEY, J.L. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept. 1975), 509-517.

Crossref

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[4]

FRIEDMAN, J.H., BENTLEY, J.L. AND FINKEL, R.A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 3 (Sept. 1977), 209-226.

Crossref

Google Scholar

[5]

GAREY, M.R. AND JOHNSON, D.S. Computers and Intractability. W.H. Freeman and Co., San Francisco, 1979.

Google Scholar

[6]

GARGANTINI, I. An effective way to represent quadtrees. Commun. ACM 25, 12 (Dec. 1982), 905- 910.

Crossref

Google Scholar

[7]

NEVALAINEN, O. AND VESTERINEN, M. Solving the order of line drawing. Angew. Inf. 20, 1 (Jan. 1978), 15-19.

Google Scholar

[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.

Google Scholar

Cited By

View all

Eades PWormald N(2016)Performance Guarantees For A Plotter Optimization HeuristicINFOR: Information Systems and Operational Research10.1080/03155986.1987.1173204725:4(314-319)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1987.11732047
Cunto WLau GFlajolet P(2005)Analysis of kdt-trees: Kd-trees improved by local reorganisationsAlgorithms and Data Structures10.1007/3-540-51542-9_4(24-38)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-51542-9_4
Jones NKennard MZundel A(2000)Fast algorithm for generating sorted contour stringsComputers & Geosciences10.1016/S0098-3004(00)00009-126:7(831-837)Online publication date: 1-Aug-2000
https://dl.acm.org/doi/10.1016/S0098-3004%2800%2900009-1
Show More Cited By

Index Terms

Techniques for Reducing Pen Plotting Time

Recommendations

Calligraphy Z: A Fabricatable Pen Plotter for Handwritten Strokes with Z-Axis Pen Pressure
UIST '22 Adjunct: Adjunct Proceedings of the 35th Annual ACM Symposium on User Interface Software and Technology

In the current age, the use of desktop publishing software and printing presses makes it possible to produce various expressions. On the other hand, it is difficult to perfectly replicate the ink grazing and subtle pressure fluctuations that occur when ...
Data and presentation techniques for fast, simple, and automatic plotting

We present a set of data-plotting techniques that help users, especially those with time constraints, in inferring conclusions flom measurement data quickly and with minimal efforts. The developed methods deal with speeding up the data file reading ...
A comparison of two handwriting recognizers for pen-based computers
CASCON '94: Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research

An experiment is described that compares two commercial handwriting recognizers with handprinted characters. Each recognizer was tested at two levels of constraint, one using lowercase letters (which were the only symbols included in the input text) and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 2, Issue 3

July 1983

52 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/357323

Editor:
R. Daniel Bergeron

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1983

Published in TOG Volume 2, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
1,020
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)15

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Eades PWormald N(2016)Performance Guarantees For A Plotter Optimization HeuristicINFOR: Information Systems and Operational Research10.1080/03155986.1987.1173204725:4(314-319)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1987.11732047
Cunto WLau GFlajolet P(2005)Analysis of kdt-trees: Kd-trees improved by local reorganisationsAlgorithms and Data Structures10.1007/3-540-51542-9_4(24-38)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-51542-9_4
Jones NKennard MZundel A(2000)Fast algorithm for generating sorted contour stringsComputers & Geosciences10.1016/S0098-3004(00)00009-126:7(831-837)Online publication date: 1-Aug-2000
https://dl.acm.org/doi/10.1016/S0098-3004%2800%2900009-1
Ramasubramanian VPaliwal K(1997)Fast Vector Quantization Encoding Based onK-d Tree Backtracking Search AlgorithmDigital Signal Processing10.1006/dspr.1997.02917:3(163-187)Online publication date: Jul-1997
https://doi.org/10.1006/dspr.1997.0291
Shasha DWang T(1990)New techniques for best-match retrievalACM Transactions on Information Systems10.1145/96105.961118:2(140-158)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1145/96105.96111
Samet HWebber R(1988)Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.IEEE Computer Graphics and Applications10.1109/38.5138:3(48-68)Online publication date: 1-May-1988
https://dl.acm.org/doi/10.1109/38.513
Nievergelt JHinrichs K(1987)Storage and Access Structures for Geometric Data BasesFoundations of Data Organization10.1007/978-1-4613-1881-1_37(441-455)Online publication date: 1987
https://doi.org/10.1007/978-1-4613-1881-1_37
Owen J(1986)Computer graphics and CAD literature—A keyword-indexed bibliographyComputer Graphics Forum10.1111/j.1467-8659.1986.tb00304.x5:3(233-264)Online publication date: 1-Sep-1986
https://dl.acm.org/doi/10.1111/j.1467-8659.1986.tb00304.x
Samet H(1986)Bibliography on quadtrees and related hierarchical data structuresData Structures for Raster Graphics10.1007/978-3-642-71071-1_11(181-201)Online publication date: 1986
https://doi.org/10.1007/978-3-642-71071-1_11
Samet H(1984)The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys10.1145/356924.35693016:2(187-260)Online publication date: 1-Jun-1984
https://dl.acm.org/doi/10.1145/356924.356930

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Calligraphy Z: A Fabricatable Pen Plotter for Handwritten Strokes with Z-Axis Pen Pressure

Data and presentation techniques for fast, simple, and automatic plotting

A comparison of two handwriting recognizers for pen-based computers

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations