Colored Spanning Graphs for Set Visualization

DOI10.1007/978-3-319-03841-4_25zbMath1406.68084OpenAlexW2101928287MaRDI QIDQ2867665

Maarten Löffler, Rodrigo I. Silveira, Vera Sacristán, Bettina Speckmann, Ferran Hurtado, Matias Korman, Marc J. van Kreveld

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Colored spanning graphs for set visualization ⋮ Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem ⋮ The Painter’s Problem: Covering a Grid with Colored Connected Polygons ⋮ Multi-colored spanning graphs

This page was built for publication: Colored Spanning Graphs for Set Visualization