Contact Representations of Graphs in 3D
DOI10.1007/978-3-319-21840-3_2zbMath1444.68130arXiv1501.00304OpenAlexW2963519387MaRDI QIDQ3449802
Jawaherul Alam M.D., Stephen G. Kobourov, Torsten Ueckerdt, Jackson Toeniskoetter, Sergey Pupyrev, William S. Evans
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00304
non-planar graphslinear-time algorithmquadratic-time algorithmcontact representationsL-shaped polyhedra
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Triangle contact representations and duality
- The structure of 1-planar graphs
- Representations by contact and intersection of segments
- Schnyder woods and orthogonal surfaces
- Interval representations of planar graphs
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- Circle packings of maps in polynomial time
- Remez-type inequality for discrete sets
- Ein Sechsfarbenproblem auf der Kugel
- Schnyder decompositions for regular plane graphs and application to drawing
- Generation of simple quadrangulations of the sphere
- Re-embeddings of Maximum 1-Planar Graphs
- More Canonical Ordering
- Contact Representations of Graphs in 3D
- Zur Struktur 1‐planarer Graphen
- On Representing Graphs by Touching Cuboids
- Rectangular layouts and contact graphs
- Contact representations of planar graphs with cubes
- Combinatorial and Geometric Properties of Planar Laman Graphs
- Representing graphs by disks and balls (a survey of recognition-complexity results)
This page was built for publication: Contact Representations of Graphs in 3D