Combinatorial Properties and Recognition of Unit Square Visibility Graphs

06/19/2017
by   Katrin Casel, et al.
0

Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i.e., the problem of representing USGV with fixed visibilities within small area and, for USV, the general recognition problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2018

Art Gallery Problem with Rook Vision

We introduce rook visibility, which is a new model of visibility for the...
research
10/31/2021

Computational Aspects of Problems on Visibility and Disk Graph Representations

This thesis focuses on two concepts which are widely studied in the fiel...
research
03/25/2021

Unit Disk Visibility Graphs

We study unit disk visibility graphs, where the visibility relation betw...
research
07/03/2018

Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs

An ortho-polygon visibility representation Γ of a 1-plane graph G (OPVR ...
research
06/22/2023

Geometric Graphs with Unbounded Flip-Width

We consider the flip-width of geometric graphs, a notion of graph width ...
research
12/16/2018

Derivation of an Algorithm for Calculation of the Intersection Area of a Circle with a Grid with Finite Fill Factor

The problem deals with an exact calculation of the intersection area of ...
research
10/27/2012

The Hangulphabet: A Descriptive Alphabet

This paper describes the Hangulphabet, a new writing system that should ...

Please sign up or login with your details

Forgot password? Click here to reset