Grid obstacle representation of graphs

08/05/2017
by   Arijit Bishnu, et al.
0

The grid obstacle representation of a graph G=(V,E) is an injective function f:V →Z^2 and a set of point obstacles O on the grid points of Z^2 (where V has not been mapped) such that uv is an edge in G if and only if there exists a Manhattan path between f(u) and f(v) in Z^2 avoiding the obstacles of O. The grid obstacle number of a graph is the smallest number of obstacles needed for the grid obstacle representation of G. This work shows that planar graphs admit such a representation while there exists some non-planar graphs that do not admit such a representation. Moreover, we show that every graph admits grid obstacle representation in Z^3. We also show NP-hardness result for the point set embeddability of an ℓ_1-obstacle representation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/06/2017

Grid-Obstacle Representations with Connections to Staircase Guarding

In this paper, we study grid-obstacle representations of graphs where we...
research
09/24/2018

Rectilinear Shortest Paths Among Transient Obstacles

This paper presents an optimal Θ(n n) algorithm for determining time-mi...
research
07/22/2011

Computing the obstacle number of a plane graph

An obstacle representation of a plane graph G is V(G) together with a se...
research
02/25/2022

Outside-Obstacle Representations with All Vertices on the Outer Face

An obstacle representation of a graph G consists of a set of polygonal o...
research
03/09/2018

Geodesic Obstacle Representation of Graphs

An obstacle representation of a graph is a mapping of the vertices onto ...
research
04/23/2019

A Novel Multi-layer Framework for Tiny Obstacle Discovery

For tiny obstacle discovery in a monocular image, edge is a fundamental ...
research
11/17/2021

Tiny Obstacle Discovery by Occlusion-Aware Multilayer Regression

Edges are the fundamental visual element for discovering tiny obstacles ...

Please sign up or login with your details

Forgot password? Click here to reset