Name: | Description: | Size: | Format: | |
---|---|---|---|---|
This research aims to create a new approach for spider maps production that results in a fast and automatic method having as input only network location data. Schematization task is commonly done by hand or by purely graphics software. This is a difficult and time consuming task that also needs a skilled map designer, which results in an expensive outcome. A configurable force-directed algorithm allows fast creation of eyepleasing schematic maps, avoiding labor-intensive manual arrangement. In the other hand, different sets of design rules and constraints may be used to quickly generate alternatives, and allow the configuration of a distinctive graphic style. This document presents some of the rules and constraints that may be used to output a map that meets certain criteria in order to be used as a spider map in transportation systems. We present results with real public transport network datasets, and discuss possible evaluation criteria. The present work introduces a new set of experimental validations that confirm the previous research but also leading to new open issues for future work. | 462.36 KB | Adobe PDF |
Advisor(s)
Abstract(s)
This research aims to create a new approach for spider maps production that results in a fast and automatic method having as input only network location data. Schematization task is commonly done by hand or by purely graphics software. This is a difficult and time consuming task that also needs a skilled map designer, which results in an expensive outcome. A configurable force-directed algorithm allows fast creation of eyepleasing schematic maps, avoiding labor-intensive manual arrangement. In the other hand, different sets of design rules and constraints may be used to quickly generate alternatives, and allow the configuration of a distinctive graphic style. This document presents some of the rules and constraints that may be used to output a map that meets certain criteria in order to be used as a spider map in transportation systems. We present results with real public transport network datasets, and discuss possible evaluation criteria. The present work introduces a new set of experimental validations that confirm the previous research but also leading to new open issues for future work.
Description
EISBN - 9781466657489
Ribeiro, João Tiago - Scopus ID: 56597460900
Ribeiro, João Tiago - Scopus ID: 56597460900
Keywords
Dynamic Graph Layout Graph Drawing Algorithms Layout Algorithms Schematic Maps Spider Maps
Pedagogical Context
Citation
Ribeiro, J. T., Rijo, R., & Leal, A. (2014). A New Approach for Schematics for Public Transport Spider Maps. Information Resources Management Journal (IRMJ), 27(1), 67-87. https://doi.org/10.4018/irmj.2014010105.
Publisher
IGI Global