(Enter summary)
Abstract: The tree-drawing problem is to produce a `tidy' mapping of elements of a tree to points in the plane. In this paper, we derive an efficient algorithm for producing tidy drawings of trees. The specification, the starting point for the derivations, consists of a collection of intuitively appealing criteria satisfied by tidy drawings. The derivation shows constructively that these criteria completely determine the drawing. Indeed, the criteria completely determine a simple but inefficient... (Update)
Context of citations to this paper: More
.... of tree algorithms, such as the parallel pre x algorithm for pre x sums [15, 8] Reingold and Tilford s algorithm for drawing trees tidily [21, 9], and algorithms for query evaluation in structured text [16, 23] There are two varieties of accumulation on lists: leftwards and...
Cited by: More
Generic Downwards Accumulations - Gibbons (2000)
(Correct)
Drawing Trees - Kennedy (1996)
(Correct)
Similar documents (at the sentence level):
46.4%: Deriving Tidy Drawings of Trees - Gibbons (1995)
(Correct)
38.2%: How to Derive Tidy Drawings of Trees - Gibbons (1994)
(Correct)
Active bibliography (related documents): More All
0.6: TreeDraw: A Tree-Drawing System - Luo (1993)
(Correct)
0.5: Table Diversions - Kees Van Der (1992)
(Correct)
0.4: Graphical Application and Visualization of Lazy Functional.. - Foubister (1995)
(Correct)
Similar documents based on text: More All
1.0: Computing Downwards Accumulations on Trees Quickly - Gibbons (1995)
(Correct)
0.3: On P_4-tidy graphs - Giakoumakis, Roussel, Thuillier (1997)
(Correct)
0.3: The Visualization and Measurement of Left Ventricular - Deformation Burkhard Wunsche
(Correct)
Related documents from co-citation: More All
2: The promotion and accumulation strategies in transformational programming (context) - Bird - 1984
2: IEEE Transactions on Software Engineering (context) - Reingold, Tilford et al. - 1981
BibTeX entry: (Update)
J. Gibbons. Deriving tidy drawings of trees. Journal of Functional Programming, this issue. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, Mass., 1989. http://citeseer.ist.psu.edu/gibbons95deriving.html More
@techreport{ gibbons95deriving,
author = "J. Gibbons",
title = "Deriving Tidy Drawings of Trees",
year = "1995",
url = "citeseer.ist.psu.edu/gibbons95deriving.html" }
Citations (may not include all citations):
138
Lectures on constructive functional programming (context) - Bird - 1988
100
Volume 1: Fundamental Algorithms (context) - Knuth, of et al. - 1968
81
Algorithmics: Towards programming as a mathematical activity (context) - Meertens - 1986
63
Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
43
Data Structures = Programs (context) - Wirth - 1976
27
A node-positioning algorithm for general trees (context) - Walker - 1990
25
IEEE Transactions on Software Engineering (context) - Reingold, Tilford et al. - 1981
25
The complexity of drawing trees nicely (context) - Supowit, Reingold - 1983
23
Upwards and downwards accumulations on trees (context) - Gibbons
17
A note on a standard strategy for developing loop invariants.. (context) - Gries - 1982
10
IEEE Transactions on Software Engineering (context) - Wetherell, Shannon et al. - 1979
8
Logic of Programming and Calculi of Discrete Design (context) - Bird, to et al. - 1987
5
Journal of Functional Programming (context) - Kennedy, trees - 1995
5
An initial-algebra approach to directed acyclic graphs
- Gibbons - 1995
5
Software---Practice and Experience (context) - Vaucher, trees - 1980
4
Parallel evaluation of structured queries in text (context) - Skillicorn - 1993
4
A revised version appears in the Proceedings of the Massey F.. (context) - Bird, Morgan - 1992
4
Software---Practice and Experience (context) - Bloesch, of et al. - 1993
2
Drawing trees nicely with T E X (context) - Br, DerickWood - 1990
2
How to derive tidy drawings of trees
- Gibbons - 1994
2
Department of Computer Engineering and Science (context) - Radack, of et al. - 1988
1
LNCS 323: Attribute Grammars---De#nitions (context) - Deransart, Jourdan et al. - 1988
Documents on the same site (http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl): More
On a problem of L. Priese - Tomescu (1996)
(Correct)
Computably Presentable Models of Theories with Few Models - Khoussainov, Nies, Shore (1996)
(Correct)
Computably Categorical Structures and Expansions by.. - Cholak, Goncharov.. (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC