---
title: Visibility Graphs
url: https://www.emergentmind.com/topics/visibility-graphs
type: topic
---

# Visibility Graphs

Visibility graphs are a geometric-combinatorial construction encoding line-of-sight relationships in point sets, polygonal structures, spatial data arrays, and time series, with deep applications in computational geometry, network science, and signal analysis. At their core, a visibility graph assigns vertices to geometric objects (points, segments, bars, arcs, rectangles, etc.) and places edges according to criteria mimicking physical visibility or unobstructed connection—often requiring that a segment between two vertices contains no intervening object or point. The precise visibility rule and the class of objects considered (points, bars, arcs, polygons, etc.) determines numerous subclasses (point visibility graphs, bar/arc/k-visibility graphs, polygon visibility graphs, terrain visibility graphs, rectangle visibility graphs, transparent rectangle visibility graphs, etc.). This article surveys foundational theories, construction algorithms, graph-theoretic properties, complexity results, practical applications, and open problems.

## 1. Formal Architectures and Variants

### 1.1 Natural and Horizontal Visibility Graphs

Let $\{(x_i, y_i)\}_{i=1}^N$ be a sequence of real-valued measurements (time series, spatial scans, or feature map activations) indexed such that $x_i < x_{i+1}$. The *natural visibility graph* (NVG) connects $(x_i, y_i)$ and $(x_j, y_j)$ ($i<j$) iff for every intermediate $k$ ($i<k<j$),
\[
y_k < y_j + (y_i - y_j)\frac{x_j - x_k}{x_j - x_i}\,.
\]
This ensures the line of sight between $(x_i, y_i)$ and $(x_j, y_j)$ is never "obscured" by a higher intermediate point.

The *horizontal visibility graph* (HVG) is a restrictive variant: $(x_i, y_i)$ and $(x_j, y_j)$ ($i<j$) are linked iff for every $k$ ($i<k<j$),
\[
y_k < \min\{y_i, y_j\}.
\]
This restricts visibility to horizontal rays above all intermediates. HVGs admit closed combinatorial characterizations and linear-time recognition [1010.1850].

### 1.2 Weighted Visibility Graphs

If $(x_i, y_i)$ and $(x_j, y_j)$ are connected in the NVG, assign to edge $(i, j)$ the weight
\[
w_{ij} = \arctan\left(\frac{y_j - y_i}{x_j - x_i}\right) \in (-\tfrac{\pi}{2}, \tfrac{\pi}{2}),
\]
interpreted as the viewing angle or slope [2108.12490].

### 1.3 k-Visibility Graphs

Given geometric objects (bars, arcs, circles), the *k-visibility graph* connects two objects if a sightline joining them intersects at most $k$ other objects. Increasing $k$ allows "seeing through" further occlusions, interpolating between classical (0-visibility) and complete graphs as $k\to\infty$ [1305.0505, 1601.01231].

#### Bar and Arc k-Visibility Definitions

- **Bar k-visibility:** Vertices correspond to horizontal line segments. Two bars are adjacent iff a vertical sightline joins them through at most $k$ other bars.
- **Arc k-visibility:** Vertices as concentric arcs; adjacent if a radial sightline intersects up to $k$ additional arcs.

## 2. Image, Spatial, and Higher-Dimensional Visibility Graphs

Visibility graphs generalize from 1D to spatially extended data.

### 2D and dD Scalar Fields

Given $I \in \mathbb{R}^{N \times N}$ (image or 2D field), the *image visibility graph* (IVG) connects pixels $(i,j)$ and $(k,\ell)$ along aligned directions ($i=k$, $j=\ell$, $i-k = j-\ell$, $i-k = \ell-j$), provided all intermediates satisfy the convexity criterion.

- **IHVG (FCC extension):** Use the HVG rule along $n$ directions (canonical $n=4$, FCC $n=8$), e.g.,
\[
I_{k\ell} < \min\{I_{ij}, I_{mn}\}
\]
for each pixel $(i,j)$ and $(m,n)$ along direction $p$. Generalizations to arbitrary dimensions $d$ consider $2d + 2^d$ directions [1702.07813, 1804.07125].

### Graph Features

Key descriptors include:
- Degree distribution $P(k)$—captures randomness, fractality, or periodicity.
- Local motifs ("visibility patches")—encode texture for classification [1804.07125].
- Clustering coefficients, spectral measures, and average path lengths.

## 3. Polygonal, Terrain, and Rectangle Visibility Graphs

### Polygon Visibility Graphs

For a polygon $P \subset \mathbb{R}^2$, the visibility graph connects two boundary vertices iff the segment joining them is entirely interior to $P$. Complexity of recognition is complete for the existential theory of the reals (ETR) when considering polygons with holes or internal/external visibility pairs [1804.05105].

### Terrain Visibility Graphs

Defined via $x$-monotone polygonal chains (terrains), terrain visibility graphs capture "above-terrain" relationships; they satisfy strong structural constraints (no large induced antiholes, strict order in cycles) and admit output-sensitive shortest path algorithms on terrain-like graphs, though recognition remains open [1904.08746].

### Rectangle and Transparent Rectangle Visibility Graphs

- **Rectangle visibility graphs (RVG):** Vertices correspond to axis-parallel rectangles; edges indicate unobstructed horizontal or vertical lines of sight.
- **Transparent rectangle visibility graphs (TRVG):** Allow rectangles to be penetrable by sightlines—two rectangles are adjacent if any axis-aligned line meets both interiors, regardless of overlap by other rectangles. Families include all trees, cycles, threshold graphs, rectangular/triangular/hexagonal grids [2506.14522].

## 4. Analytical Structure, Degree Distributions, and Enumeration

### Degree Distributions

- **Random time series/VG:** $P(k) \sim C e^{-\alpha k}$; HVG yields closed-form shifted geometric distributions independent of marginal distributions: $P(k) = \frac{1}{n+1} (\frac{n}{n+1})^{k-n}$ for $k \geq n$ [1702.07813].
- **Fractal/chaotic series:** $P(k) \sim k^{-\gamma}$ with $\gamma$ tied to the fractal dimension or Hurst exponent [0810.0920].

### Uniqueness and Enumeration of HVGs

- HVGs are outerplanar graphs with a Hamilton path [1010.1850].
- Degree sequence uniquely determines an HVG for sequences without ties [2111.02723]; counted by Catalan numbers for distinct entries, and by large Schröder numbers if ties are allowed.

## 5. Computational Complexity and Recognition Problems

### Point Visibility Graphs

Point visibility graphs (PVGs) associate vertices with planar points and edges with unobstructed segments. Recognition is $\exists\mathbb{R}$-complete: determining if a graph is a PVG is as hard as solving a system of real polynomial (in)equalities, due to arithmetic universality and combinatorial gadgets ("fan" construction) [1503.07082]. Further, problems such as Feedback Vertex Set, Longest Induced Path, Bisection, and $\mathcal{F}$-free Vertex Deletion remain NP-hard, even on PVGs [1711.01811].

### Polygon Visibility Graphs

Recognition for visibility graphs of polygons with holes or internal/external graphs is $\exists\mathbb{R}$-complete [1804.05105]. Simple polygons (without holes) remain open.

### Algorithmic Advances

- **Efficient construction:** Online/encoder–decoder algorithms using BST codecs enable $O(N\log N)$ HVG/NVG construction and real-time incremental updates for large time series [1905.03204].
- **Output-sensitive shortest path:** Specialized algorithms on terrain-like graphs achieve $O(d^*)$ complexity, where $d^*$ is the path-length [1904.08746].

## 6. Graph-Theoretic Properties: Connectivity, Thickness, Chromatic Number

The visibility structure imposes high connectivity: Non-collinear visibility graphs have diameter $2$, edge-connectivity equals minimum degree, and vertex-connectivity at least $(n-1)/(\ell-1)$ (where $\ell$ bounds collinearity), or at least $\frac{1}{2} \delta$ universally [1106.3622]. For k-visibility graphs, thickness and chromatic numbers scale linearly with $k$, e.g., arc k-visibility graphs have thickness at most $3k+3$, chromatic number $6k+6$ [1305.0505, 1601.01231].

## 7. Applications and Interpretational Insights

Visibility graphs bridge geometry and data-driven analysis in texture classification [2108.12490], time-series characterization [0810.0920], image processing [1804.07125], material science [1807.03063], turbulence discrimination [1702.07813], and architectural/urban design—where weather-induced attenuation is modeled via exponential decay of visibility weights [2108.04231]. In neural architectures, constructing visibility graphs over convolutional feature maps injects fractal and periodic cues ignored by global pooling, improving classification without changing the network [2108.12490]. In image analytics, local motif histograms ("visibility patches") yield highly discriminative, robust features for texture recognition and compression [1804.07125].

## 8. Controversies, Open Problems, and Research Horizons

- Graph-theoretic characterization and recognition for terrain and general polygon visibility graphs remain unresolved.
- Complexity separation: $\exists\mathbb{R}$-completeness often precludes efficient certifiability; for some cases, grid-realizability is likely undecidable.
- Independence of geometric invariants: Rectangle visibility graphs show that minimal area, perimeter, width, and height can require distinct representations [2208.09961].
- Integrating physical phenomena: Weighted visibility graphs with attenuation coefficients enable urban analysis under variable weather [2108.04231].
- Class separation: Families of k-visibility graphs (bar vs arc vs semi-bar/semi-arc) are mutually incomparable; thresholds for extremal edge counts and chromatic numbers are tight up to constant factors.
- Enumeration: Catalan and Schröder numbers encode subtle combinatorial structure in HVG families [2111.02723].

Visibility graphs remain central to translating geometric, temporal, and spatial structure into universal graph-homomorphic features, with continuous cross-fertilization between combinatorics, computational geometry, statistical physics, network science, and data-driven inference.

Source: https://www.emergentmind.com/topics/visibility-graphs