scientific article; zbMATH DE number 1974134

MaRDI QIDQ4422296zbMATH OpenFDO

Authors Walter Bachl

Publication date 3 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280354.htm

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)

Recommendations

• Area-efficient static and incremental graph drawings
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• Graph Drawing
• Morphing orthogonal planar graph drawings
• A better heuristic for orthogonal graph drawings

Cited in

(8)

• Orthogonal drawings based on the stratification of planar graphs
• Obedient plane drawings for disk intersection graphs
• scientific article; zbMATH DE number 2080110 (Why is no real title available?)
• Computing and Combinatorics
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
• Smooth Orthogonal Drawings of Planar Graphs
• The DFS-heuristic for orthogonal graph drawing
• Area-efficient static and incremental graph drawings

This page was built for publication:

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