Short Plane Supports for Spatial Hypergraphs

DOI10.7155/jgaa.00499zbMath1419.05157OpenAlexW3021851548WikidataQ127292454 ScholiaQ127292454MaRDI QIDQ5233132

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

Publication date: 16 September 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00499

zbMATH Keywords

visualization of spatial hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Multi-colored spanning graphs

Uses Software

• MapSets

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