1992
DOI: 10.1515/9781400882458
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorics of Train Tracks. (AM-125)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
522
0
3

Year Published

1995
1995
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 323 publications
(538 citation statements)
references
References 0 publications
2
522
0
3
Order By: Relevance
“…As a matter of fact, Levy's thesis is probably the first place where Thurston's theorem on the characterization of rational maps was used. To give another example, Penner's name is completely absent from the bibliography of this volume, whereas it should be there, at least for his lucid exposition, with Harer, of train tracks [32], for his general construction of pseudo-Anosov diffeomorphisms [31], his algorithms to find them, and for his work on the dilatation factors of these maps, a topic which is discussed in this book.…”
Section: On Attributing Results and On Bibliographical Referencesmentioning
confidence: 99%
“…As a matter of fact, Levy's thesis is probably the first place where Thurston's theorem on the characterization of rational maps was used. To give another example, Penner's name is completely absent from the bibliography of this volume, whereas it should be there, at least for his lucid exposition, with Harer, of train tracks [32], for his general construction of pseudo-Anosov diffeomorphisms [31], his algorithms to find them, and for his work on the dilatation factors of these maps, a topic which is discussed in this book.…”
Section: On Attributing Results and On Bibliographical Referencesmentioning
confidence: 99%
“…Although we are not familiar with any prior work on the automatic display of graphs using this confluent diagram approach, we have observed that some airlines use hand-crafted confluent diagrams to display their route maps. Diagrams similar to our confluent drawings have also been used by Penner and Harer [33] to study the topology of surfaces. In addition to providing heuristic algorithms for recognizing and drawing confluent diagrams, we also show that there are large classes of non-planar graphs that can be drawn in a planar way using our confluent diagram approach.…”
Section: Our Resultsmentioning
confidence: 99%
“…We recall here facts about train tracks and bigon tracks, see [20], [18]. Let τ ⊂ Z be a smooth 1-dimensional branched manifold: thus τ is a 1-dimensional CW-complex in which the interiors of edges are smooth curves, and the field of TOME 59 (2009), FASCICULE 4 tangent lines T x τ, x ∈ τ \ {vertices}, extends to a continuous line field on τ.…”
Section: Tracksmentioning
confidence: 99%
“…Note also that the carrying matrix of the inverse Φ −1 is M T Φ . See [18] for more discussion of this. When Φ is a pseudo Anosov of Thurston-Penner type, we may calculate the carrying matrix using the bigon track defined in §4.…”
Section: Carrying Matricesmentioning
confidence: 99%