Drawing planar graphs symmetrically. II: Biconnected planar graphs

DOI10.1007/S00453-004-1132-ZMaRDI QIDQ2483999zbMATH OpenOpenAlexFDO

Authors Seok-Hee Hong, Peter Eades

Publication date 2 August 2005

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1132-z

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) 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

• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• scientific article; zbMATH DE number 1303032
• scientific article; zbMATH DE number 2119683
• A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
• Fast detection and display of symmetry in outerplanar graphs

Cited in

(13)

• Testing planarity of geometric automorphisms in linear time
• Fast detection and display of symmetry in outerplanar graphs
• Geometric automorphism groups of graphs
• Drawing planar graphs symmetrically. III: Oneconnected planar graphs
• A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
• scientific article; zbMATH DE number 4045185 (Why is no real title available?)
• scientific article; zbMATH DE number 1303032 (Why is no real title available?)
• scientific article; zbMATH DE number 1974110 (Why is no real title available?)
• scientific article; zbMATH DE number 2086772 (Why is no real title available?)
• scientific article; zbMATH DE number 2119683 (Why is no real title available?)
• scientific article; zbMATH DE number 1389215 (Why is no real title available?)
• Algorithms and Computation
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs

Describes a project that uses

Uses Software

• PIGALE

This page was built for publication: Drawing planar graphs symmetrically. II: Biconnected planar graphs

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