Abstract

The automatic construction of good drawings of abstract graphs is a problem of practical importance. Symmetry appears as one of the main criteria for achieving goodness. Algorithms are developed for enumerating all planar axial and rotational symmetrics of a biconnected outerplanar graph, and it is shown how to construct a drawing which simultaneously displays all these symmetries. These results are then expanded to obtain algorithms for the detection and display of outerplanar axial and rotational symmetry in the entire class of outerplanar graphs. All algorithms run in both time and space which are linear in the size of the graph, and hence are optimal to within a constant factor.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.