On Area-Universal Quadrangulations

Authors

  • William Evans
  • Stefan Felsner
  • Linda Kleist
  • Stephen Kobourov

DOI:

https://doi.org/10.7155/jgaa.00555

Abstract

We study drawings of plane quadrangulations such that every inner face realizes a prescribed area. A plane graph is area-universal if for every assignment of non-negative weights to the inner faces, there exists a straight-line drawing such that the area of each inner face equals the weight of the face. It has been conjectured that all plane quadrangulations are area-universal. We develop methods to prove area-universality via reduction to the area-universality of related graphs. This allows us to establish area-universality for large classes of plane quadrangulations. In particular, our methods are strong enough to prove area-universality of all plane quadrangulations with up to 13 vertices.

Downloads

Download data is not yet available.

Downloads

Published

2021-01-01

How to Cite

Evans, W., Felsner, S., Kleist, L., & Kobourov, S. (2021). On Area-Universal Quadrangulations. Journal of Graph Algorithms and Applications, 25(1), 171–193. https://doi.org/10.7155/jgaa.00555

Issue

Section

Articles

Categories