DeepAI

# Local Complexity of Polygons

Many problems in Discrete and Computational Geometry deal with simple polygons or polygonal regions. Many algorithms and data-structures perform considerably faster, if the underlying polygonal region has low local complexity. One obstacle to make this intuition rigorous, is the lack of a formal definition of local complexity. Here, we give two possible definitions and show how they are related in a combinatorial sense. We say that a polygon P has point visibility width w=pvw, if there is no point q∈ P that sees more than w reflex vertices. We say that a polygon P has chord visibility width w=cvw, if there is no chord c=seg(a,b)⊂ P that sees more than w reflex vertices. We show that cvw ≤ pvw ^O( pvw ), for any simple polygon. Furthermore, we show that there exists a simple polygon with cvw ≥ 2^Ω( pvw ).

11/19/2020

### Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane

We devise an algorithm for maintaining the visibility polygon of any que...
03/27/2018

### An Optimal Algorithm for Computing the Visibility Area of a Polygon from a Point Using Constant-Memory

Given a simple polygon P of n vertices in the Plane. We study the prob...
11/06/2017

### Computational Complexity Aspects of Point Visibility Graphs

A point visibility graph is a graph induced by a set of points in the pl...
04/13/2018

### Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons

Visibility graph of a polygon corresponds to its internal diagonals and ...
03/27/2018

### A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint

Given a simple polygon P of n vertices in the Plane. We study the pr...
08/28/2023

### Mutual visibility in hypercube-like graphs

Let G be a graph and X⊆ V(G). Then, vertices x and y of G are X-visible ...
07/20/2017

### Pictures of Combinatorial Cubes

We prove that the 8-point algorithm always fails to reconstruct a unique...