Orthogonal cartograms with few corners per face
| dc.contributor.author | Biedl, Therese | |
| dc.contributor.author | Velazquez, Lesvia Elena Ruiz | |
| dc.date.accessioned | 2026-09-22T18:54:25Z | |
| dc.date.issued | 2010-12-03 | |
| dc.description.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 four bends per edge, which improves the previous known result of 34 corners per face. | |
| dc.identifier.uri | https://hdl.handle.net/10012/24386 | |
| dc.language.iso | en | |
| dc.publisher | University of Waterloo | |
| dc.relation.ispartofseries | Computer Science Technical Reports; CS-2010-21 | |
| dc.title | Orthogonal cartograms with few corners per face | |
| dc.type | Technical Report | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Unreviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |