Skip to main content
Conference ProceedingsOPEN ACCESS

A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs

Lecture Notes in Computer Science (2004) 3383 307-317
DOI: 10.1007/978-3-540-31843-9_31
5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a linear time algorithm for constructing maximally symmetric straight-line drawings of biconnected and one-connected planar graphs. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Hong, S. H., & Eades, P. (2004). A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs. In Lecture Notes in Computer Science (Vol. 3383, pp. 307–317). https://doi.org/10.1007/978-3-540-31843-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free