Skip to main content
Article thumbnail
Location of Repository

Orthogonal cartograms with few corners per face

By Therese Biedl and Lesvia Elena Ruiz Velázquez

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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.5785
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.uwaterloo.ca/res... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.