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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics