Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
414292 | Computational Geometry | 2014 | 13 Pages |
Abstract
We give an algorithm to create orthogonal drawings of 3-connected 3-regular plane 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Therese Biedl, Lesvia Elena Ruiz Velázquez,