Algorithms for cartographic visualization
Explore this paper's citation graph
Summary
An efficient algorithm to compute a collection of non-crossing paths with fixed orientations using as few links as possible is developed, which approximates the optimal solution to within a factor that depends only on the number of allowed orientations.
- Type
- article
- Published
- 2012-01-01
- Cited by
- 42
- References
- 220
- Access
- Open access
- OpenAlex
- https://openalex.org/W59519219
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:127727118
Keywords
Schematic, Thematic map, Computer science, Visualization, Cartographic generalization
References
- Complexity of Octagonal and Rectangular Cartograms
- River Routing Every Which Way, but Loose (Extended Abstract)
- Stochastic models for quality of service of component connectors
- A Constraint-Based Approach to Constructing Continuous Cartograms
- Service-oriented discovery of knowledge: foundations, implementations and applications
- From computability to executability : a process-theoretic view on automata theory
- Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)
- Probability and hiding in concurrent processes
- Assessing and improving the quality of modeling : a series of empirical studies about the UML
- Verification Techniques for Extensions of Equality Logic
- The Geography of Transport Systems
- Hybrid Techniques for Hybrid Systems
- Modelling and analysis of real-time coordination patterns
- Strategies for Context Sensitive Program Transformation
- Tree Algorithms: Two Taxonomies and a Toolkit
- Modeling and validating distributed embedded real-time control systems
- Constructive formal methods and protocol standardization
- Model-based integration and testing of high-tech multi-disciplinary systems
- Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
- An illumination of the template enigma : software code generation with templates
Cited by
- JTorX: exploring model-based testing
- The process matters: cyber security in industrial control systems
- Compositional Synthesis of Safety Controllers
- Scalable multi-core model checking
- Web Service Growing Pains: Understanding Services and Their Clients
- Test Suite Comprehension for Modular and Dynamic Systems
- Performance Optimization of Multi-Tenant Software Systems
- The (in)security of proprietary cryptography
- Applications of Evolutionary Computation to Cryptology ; Primjene evolucijskog računarstva u kriptologiji
- Coalgebraic Characterizations of Automata-Theoretic Classes
- Performance analysis of real-time task systems using timed automata
- Software analysis methods for resource-sensitive systems
- Lessons learned in the analysis of the EMV and TLS security protocols
- A Compositional Interchange Format for Hybrid Systems: Design and Implementation
- Efficient implementations of attribute-based credentials on smart cards
- Qualitative and Quantitative Information Flow Analysis for Multi-threaded Programs
- On the Incremental Evaluation of Higher-Order Attribute Grammars
- Abstract Graph Transformation - Theory and Practice
- Efficient modelling, generation and analysis of Markov automata
- Domain specific languages and their type systems
Related papers
- Optimal Geometric Data Structures
- Model Checking of Component Connectors
- Formal models for component connectors
- TuLiP : reshaping trust management
- The Computational Complexity of Probabilistic Networks
- Modelling and analysis of real-time coordination patterns
- Analysis of flow and visibility on triangulated terrains
- Metrics and visualisation for crime analysis and genomics
- On changing models in model-based testing
- Spiking Neural P Systems