On the area-universality of triangulations
From MaRDI portal
Publication:1725766
DOI10.1007/978-3-030-04414-5_23OpenAlexW2888876582MaRDI QIDQ1725766
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.10864
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ On the area-universality of triangulations ⋮ On Area-Universal Quadrangulations
Cites Work
- Unnamed Item
- Unnamed Item
- On rectilinear duals for vertex-weighted plane graphs
- Table cartogram
- On the area-universality of triangulations
- Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27--29, 2018. Proceedings
- Drawing planar 3-trees with given face areas
- Area-Universal and Constrained Rectangular Layouts
- Floorplans, planar graphs, and layouts
- Plane Cubic Graphs with Prescribed Face Areas
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
- Drawing planar graphs with prescribed face areas
- Orthogonal Cartograms with Few Corners Per Face
- Exploiting Air-Pressure to Map Floorplans on Point Sets
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- Convex Maps
- On Area-Universal Quadrangulations
- Computing cartograms with optimal complexity
This page was built for publication: On the area-universality of triangulations
