Complexity Measures for Mosaic Drawings
DOI10.1007/978-3-319-53925-6_12zbMATH Open1485.68173OpenAlexW2588862388WikidataQ59782222 ScholiaQ59782222MaRDI QIDQ2980906FDOQ2980906
Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/2dea061f-1720-460e-87f7-9cff3a37105a
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
- Computing cartograms with optimal complexity
- On rectilinear duals for vertex-weighted plane graphs
- Rectangular duals of planar graphs
- On Diagrams Representing Maps
- Orderly Spanning Trees with Applications
- Pixel and Voxel Representations of Graphs
This page was built for publication: Complexity Measures for Mosaic Drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980906)
