Confluent drawing algorithms using rectangular dualization

DOI10.1007/978-3-642-18469-7_31zbMATH Open1314.68240OpenAlexW1760038106MaRDI QIDQ3073685FDOQ3073685

Authors: Gianluca Quercini, Massimo Ancona 

Publication date: 11 February 2011

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_31

Recommendations

• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Graph Drawing
• Biclique Edge Cover Graphs and Confluent Drawings
• Graph Drawing
• Confluent layered drawings

zbMATH Keywords

orthogonal drawingclustered graphsconfluent drawingrectangular dualization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (4)

• Strict Confluent Drawing
• Confluent layered drawings
• Title not available (Why is that?)
• Graph Drawing

This page was built for publication: Confluent drawing algorithms using rectangular dualization

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