2011
DOI: 10.1007/s13398-011-0010-1
|View full text |Cite
|
Sign up to set email alerts
|

Automatically obtaining railway maps from a set of historical events

Abstract: We present here what, as far as we know, is a real novelty: a computer package that can automatically generate railway maps of a certain network at any (past) date requested, using different colors to show the type of line. The input is: (1) a set of historical events, (2) the graph of the railway network at its maximum extension and (3) a list of geographical coordinates of stations, junctions, loading bays, … (that are the nodes of the graph). The package processes the set of historical events (affecting who… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Another example is [8], where Voronoi diagrams are used to generate a cost-effective path while maintaining a minimum distance between the alignment and historical buildings. Yet another example is [10], where graph theory is applied to construct the map of a railway network at any date, given the set of historical events affecting this network.…”
Section: The Key Ideamentioning
confidence: 99%
“…Another example is [8], where Voronoi diagrams are used to generate a cost-effective path while maintaining a minimum distance between the alignment and historical buildings. Yet another example is [10], where graph theory is applied to construct the map of a railway network at any date, given the set of historical events affecting this network.…”
Section: The Key Ideamentioning
confidence: 99%