Article

Free access

A redisplay algorithm

Author:

James GoslingAuthors Info & Claims

Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation

Pages 123 - 129

https://doi.org/10.1145/800209.806463

Published: 01 April 1981 Publication History

PDF eReader

Abstract

This paper presents an algorithm for updating the image displayed on a conventional video terminal. It assumes that the terminal is capable of doing the usual insert/delete line and insert/delete character operations. It takes as input a description of the image currently on the screen and a description of the new image desired and produces a series of operations to do the desired transformation in a near-optimal manner. The algorithm is interesting because it applies results from the theoretical string-to-string correction problem (a generalization of the problem of finding a longest common subsequence), to a problem that is usually approached with crude ad-hoc techniques.

References

[1]

Kevin Q. Brown. Dynamic Programming in Computer Science. CMU, February, 1979.

Google Scholar

[2]

Craig Everhart. - Personal communication

Google Scholar

[3]

James Gosling. Fred: a screen editor for Unix. CMU CSD, 1979. Unpublished manual.

Google Scholar

[4]

B. S. Greenberg. The Multics Emacs Redisplay Algorithm. Honeywell Inc., 1979.

Google Scholar

[5]

D. S. Hirschberg. "A linear space algorithm for computing maximal common subsequences." CACM 18 (1975), 341-343.

Digital Library

Google Scholar

[6]

J. W. Hunt and T. G. Szymansky. "A Fast Algorithm for Computing Longest Common Subsequences." CACM 20 (1977), 350-353.

Digital Library

Google Scholar

[7]

W. J. Masek and M. S. Paterson. A Faster Algorithm for Computing String Edit Distances. Tech. Rept. 105, MIT, May, 1978.

Google Scholar

[8]

Richard M. Stallman. EMACS manual for TWENEX users. MIT AI Lab, 1980.

Google Scholar

[9]

H. M. Wagner and M. J. Fischer. "The string-to-string correction problem." JACM 21, 1 (January 1974), 168-173.

Digital Library

Google Scholar

[10]

C. K. Wong and A. K. Chandra. "Bounds for the String Editing Problem." JACM 23 (1976), 13-16.

Digital Library

Google Scholar

Cited By

View all

Truran MGoulding JAshman H(2007)Autonomous authoring tools for hypertextACM Computing Surveys10.1145/1267070.126707239:3(8-es)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.1145/1267070.1267072
Hunt JVo KTichy W(2005)An empirical study of delta algorithmsSoftware Configuration Management10.1007/BFb0023080(49-66)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0023080
Anderson RSobti SMilenkovic V(1999)The table layout problemProceedings of the fifteenth annual symposium on Computational geometry10.1145/304893.304937(115-123)Online publication date: 13-Jun-1999
https://dl.acm.org/doi/10.1145/304893.304937
Show More Cited By

Index Terms

A redisplay algorithm

Recommendations

A redisplay algorithm

This paper presents an algorithm for updating the image displayed on a conventional video terminal. It assumes that the terminal is capable of doing the usual insert/delete line and insert/delete character operations. It takes as input a description of ...
A redisplay algorithm

This paper presents an algorithm for updating the image displayed on a conventional video terminal. It assumes that the terminal is capable of doing the usual insert/delete line and insert/delete character operations. It takes as input a description of ...
Improved algorithm for the widest empty 1-corner corridor

Given a set P of n points on a 2D plane, an empty corridor is an open region bounded by two parallel polygonal chains that does not contain any point of P, and partitions the point-set P into two non-empty parts. An empty corridor is said to be a 1-...

Comments

Information & Contributors

Information

Published In

Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation

June 1981

160 pages

ISBN:0897910508

DOI:10.1145/800209

Chairman:
Paul Abrahams

ACM SIGPLAN Notices Volume 16, Issue 6
June 1981
160 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/872730
Issue’s Table of Contents
ACM SIGOA Newsletter Volume 2, Issue 1-2
Spring/Summer 1981
160 pages
ISSN:0737-819X
DOI:10.1145/1159890
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1981

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
937
Total Downloads

Downloads (Last 12 months)173
Downloads (Last 6 weeks)31

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Truran MGoulding JAshman H(2007)Autonomous authoring tools for hypertextACM Computing Surveys10.1145/1267070.126707239:3(8-es)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.1145/1267070.1267072
Hunt JVo KTichy W(2005)An empirical study of delta algorithmsSoftware Configuration Management10.1007/BFb0023080(49-66)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0023080
Anderson RSobti SMilenkovic V(1999)The table layout problemProceedings of the fifteenth annual symposium on Computational geometry10.1145/304893.304937(115-123)Online publication date: 13-Jun-1999
https://dl.acm.org/doi/10.1145/304893.304937
Hunt JVo KTichy W(1998)Delta algorithmsACM Transactions on Software Engineering and Methodology10.1145/279310.2793217:2(192-214)Online publication date: 1-Apr-1998
https://dl.acm.org/doi/10.1145/279310.279321
Ambriola VNotkin D(1988)Reasoning About Interactive SystemIEEE Transactions on Software Engineering10.1109/32.464514:2(272-276)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1109/32.4645
Chen PCoker JHarrison MMcCarrell JProcter S(1986)The VORTEX document preparation environmentTEX for Scientific Documentation10.1007/BFb0022691(45-54)Online publication date: 1986
https://doi.org/10.1007/BFb0022691
Myers E(1986)AnO(ND) difference algorithm and its variationsAlgorithmica10.1007/BF018404461:1-4(251-266)Online publication date: Nov-1986
https://doi.org/10.1007/BF01840446
Purtilo JPayton TDeutsch L(1985)PolylithProceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments10.1145/800225.806822(12-18)Online publication date: 25-Jun-1985
https://dl.acm.org/doi/10.1145/800225.806822
Witten IBramwell B(1985)A system for interactive viewing of structured documentsCommunications of the ACM10.1145/3166.316928:3(280-288)Online publication date: 1-Mar-1985
https://dl.acm.org/doi/10.1145/3166.3169
Purtilo J(1985)PolylithACM SIGPLAN Notices10.1145/17919.80682220:7(12-18)Online publication date: 25-Jun-1985
https://dl.acm.org/doi/10.1145/17919.806822
Show More Cited By

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.

Cited By

Index Terms

Recommendations

A redisplay algorithm

A redisplay algorithm

Improved algorithm for the widest empty 1-corner corridor