An algorithm for finding three dimensional symmetry in series parallel digraphs

DOI10.1007/3-540-40996-3_23MaRDI QIDQ4472499zbMATH OpenFDO

Authors Seok-Hee Hong, Peter Eades

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Linkless symmetric drawings of series parallel digraphs
• scientific article; zbMATH DE number 2084277
• Drawing trees symmetrically in three dimensions
• Drawing series parallel digraphs symmetrically
• scientific article; zbMATH DE number 2119683

Cited in

(8)

• Pattern selection with \(\mathrm{O}(3)\) symmetry
• Drawing trees symmetrically in three dimensions
• A force-directed algorithm for drawing directed graphs symmetrically
• Perception of symmetries in drawings of graphs
• Drawing series parallel digraphs symmetrically
• Linkless symmetric drawings of series parallel digraphs
• Geometric automorphism groups of graphs
• scientific article; zbMATH DE number 2084277 (Why is no real title available?)

Describes a project that uses

Uses Software

• PIGALE

This page was built for publication: An algorithm for finding three dimensional symmetry in series parallel digraphs

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