Short plane supports for spatial hypergraphs

DOI10.1007/978-3-030-04414-5_4OpenAlexW2889004434MaRDI QIDQ1725733

Thom Castermans, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan, Mereke Van Garderen

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1808.09729

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Short plane supports for spatial hypergraphs ⋮ Short Plane Supports for Spatial Hypergraphs

Cites Work

• Path-based supports for hypergraphs
• On the red/blue spanning tree problem
• Multi-colored spanning graphs
• The clustering matroid and the optimal clustering tree
• Colored spanning graphs for set visualization
• Short plane supports for spatial hypergraphs
• Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
• Colored Non-crossing Euclidean Steiner Forest
• Hypergraph planarity and the complexity of drawing venn diagrams
• Planar Formulae and Their Uses
• The Painter’s Problem: Covering a Grid with Colored Connected Polygons
• On Planar Supports for Hypergraphs
• MapSets: Visualizing Embedded and Clustered Graphs

This page was built for publication: Short plane supports for spatial hypergraphs