Skip to main content
Conference ProceedingsOPEN ACCESS

New lower bounds for orthogonal graph drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1027 28-39
DOI: 10.1007/bfb0021788
18Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

An orthogonal drawing is an embedding of a graph such that edges are drawn as sequences of horizontal and vertical segments. In this paper we explore lower bounds. We find lower bounds on the number of bends when crossings are allowed, and lower bounds on both the grid-size and the number of bends for planar and plane drawings.

Cite

CITATION STYLE

APA

Biedl, T. C. (1996). New lower bounds for orthogonal graph drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1027, pp. 28–39). Springer Verlag. https://doi.org/10.1007/bfb0021788

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