Skip to main content
Conference Proceedings

Orthogonal cartograms with few corners per face

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6844 LNCS 98-109
DOI: 10.1007/978-3-642-22300-6_9
16Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an algorithm to create orthogonal drawings of 3-connected 3-regular planar graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and 4 bends per edge, which improves the previous known result of 34 corners per face. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Biedl, T., & Ruiz Velázquez, L. E. (2011). Orthogonal cartograms with few corners per face. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 98–109). https://doi.org/10.1007/978-3-642-22300-6_9

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