Representing graphs and hypergraphs by touching polygons in 3D

DOI10.1007/978-3-030-35802-0_2MaRDI QIDQ2206825zbMATH OpenOpenAlexFDO

Authors Noushin Saeedi, Chan-Su Shin, Alexander Wolff, W. 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)

Recommendations

• Contact representations of graphs in 3D
• Representation of Planar Hypergraphs by Contacts of Triangles
• On representing graphs by touching cuboids
• Contact representations of planar graphs with cubes
• 3D Visibility Representations by Regular Polygons

Cites work

• Complexity of some geometric and topological problems
• Contact representations of graphs in 3D
• Contact representations of planar graphs with cubes
• Convex Polygon Intersection Graphs
• Counting triangle crossings and halving planes
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 2068110 (Why is no real title available?)
• Hypergraph planarity and the complexity of drawing venn diagrams
• HYPERGRAPHS
• Intersection graphs of segments
• Interval representations of planar graphs
• Maintaining bridge-connected and biconnected components on-line
• On Contact Graphs with Cubes and Proportional Boxes
• On planar supports for hypergraphs
• Path-based supports for hypergraphs
• Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time
• Realization of Posets
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• The vectorization of ITPACK 2C

Cited in

(11)

• Hypergraph representation via axis-aligned point-subspace cover
• scientific article; zbMATH DE number 599404 (Why is no real title available?)
• The Complexity of Drawing Graphs on Few Lines and Few Planes
• On the complexity of recognizing nerves of convex sets
• A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
• Adjacency graphs of polyhedral surfaces
• The complexity of recognizing geometric hypergraphs
• Side-contact representations with convex polygons in 3D: new results for complete bipartite graphs
• Hypergraph representation via axis-aligned point-subspace cover
• The complexity of recognizing geometric hypergraphs
• Adjacency graphs of polyhedral surfaces

This page was built for publication: Representing graphs and hypergraphs by touching polygons in 3D

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206825)