Skip to main content
Conference ProceedingsOPEN ACCESS

A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1353 99-110
DOI: 10.1007/3-540-63938-1_54
8Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to find an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best known algorithm takes time (Formula Presented) for any plane graph of n vertices.

Cite

CITATION STYLE

APA

Rahman, M. S., Nakano, S. I., & Nishizeki, T. (1997). A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 99–110). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_54

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