Representing graphs and hypergraphs by touching polygons in 3D

DOI10.1007/978-3-030-35802-0_2OpenAlexW3105020981MaRDI QIDQ2206825

Alexander Wolff, Noushin Saeedi, Chan-Su Shin, William S. Evans, Paweł Rzążewski

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

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

Related Items

Hypergraph representation via axis-aligned point-subspace cover, The Complexity of Drawing Graphs on Few Lines and Few Planes, Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Path-based supports for hypergraphs
• Interval representations of planar graphs
• Maintaining bridge-connected and biconnected components on-line
• Intersection graphs of segments
• Counting triangle crossings and halving planes
• On Contact Graphs with Cubes and Proportional Boxes
• Convex Polygon Intersection Graphs
• The vectorization of ITPACK 2C
• Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
• Contact Representations of Graphs in 3D
• Complexity of Some Geometric and Topological Problems
• Hypergraph planarity and the complexity of drawing venn diagrams
• HYPERGRAPHS
• Realization of Posets
• Contact representations of planar graphs with cubes
• On Planar Supports for Hypergraphs
• Representing graphs by disks and balls (a survey of recognition-complexity results)