Drawing simultaneously embedded graphs with few bends

DOI10.1007/978-3-662-45803-7_4MaRDI QIDQ2936912zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Simultaneous embeddings with few bends and crossings
• Simultaneous embeddings with few bends and crossings
• Drawing partially embedded and simultaneously planar graphs
• Graph Drawing
• Simultaneous Embedding of Planar Graphs with Few Bends

Cited in

(13)

• Two trees which are self-intersecting when drawn simultaneously
• On the curve complexity of 3-colored point-set embeddings
• Simultaneous embeddings with few bends and crossings
• How to draw a planarization
• Simultaneous Embedding
• How to draw a planarization
• Simultaneous embeddings with few bends and crossings
• On the complexity of some geometric problems with fixed parameters
• Drawing partially embedded and simultaneously planar graphs
• Graph Drawing
• Drawing partially embedded and simultaneously planar graphs
• Drawing Simultaneously Embedded Graphs with Few Bends
• Partial and constrained level planarity

This page was built for publication: Drawing simultaneously embedded graphs with few bends

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936912)