Drawing Simultaneously Embedded Graphs with Few Bends

DOI10.1007/978-3-662-45803-7_4zbMath1426.68212OpenAlexW958790135MaRDI QIDQ2936912

Jan Kratochvíl, Luca Grilli, Ignaz Rutter, Seok-Hee Hong

Publication date: 7 January 2015

Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45803-7_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

How to Draw a Planarization ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ How to Draw a Planarization ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Simultaneous Embedding ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters

This page was built for publication: Drawing Simultaneously Embedded Graphs with Few Bends