Publication:4625135: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Non-crossing Paths with Geographic Constraints to Non-crossing Paths with Geographic Constraints: Duplicate |
(No difference)
|
Latest revision as of 16:07, 2 May 2024
DOI10.1007/978-3-319-73915-1_35zbMath1503.68233arXiv1708.05486OpenAlexW2749291451MaRDI QIDQ4625135
Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05486
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Non-crossing matchings of points with geometric objects
- Anchored Drawings of Planar Graphs
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS
- Manhattan-Geodesic Embedding of Planar Graphs
- The Problem of Compatible Representatives
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
- Non-crossing Paths with Geographic Constraints
- Non-crossing Connectors in the Plane
- Fitting Planar Graphs on Planar Maps
- Planarity for clustered graphs