3D Visibility Representations of 1-planar Graphs

by   Patrizio Angelini, et al.
Universität Tübingen
Università Perugia

We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility representation of G.


page 1

page 2

page 3

page 4


Homothetic triangle representations of planar graphs

We prove that every planar graph is the intersection graph of homothetic...

Optimal-area visibility representations of outer-1-plane graphs

This paper studies optimal-area visibility representations of n-vertex o...

Simultaneous Visibility Representations of Undirected Pairs of Graphs

We consider the problem of determining if a pair of undirected graphs ⟨ ...

Visibility Representations of Toroidal and Klein-bottle Graphs

In this paper, we study visibility representations of graphs that are em...

Solving the Forward Position Problem of an In-Parallel Planar Manipulator in the Gauss Plane

We study determining the posture of an in-parallel planar manipulator, w...

Optimized Visibility Functions for Revectorization-Based Shadow Mapping

High-quality shadow anti-aliasing is a challenging problem in shadow map...

Sensor Visibility Estimation: Metrics and Methods for Systematic Performance Evaluation and Improvement

Sensor visibility is crucial for safety-critical applications in automot...

Please sign up or login with your details

Forgot password? Click here to reset