Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Visibility graph

Known as: Visibility graphs 
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We study the statistical properties of complex networks constructed from time series of energy dissipation rates in three… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fractional Brownian motion (fBm) has been used as a theoretical framework to study real-time series appearing in diverse… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Abstract The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A human observer can effortlessly identify visible portions of geometric objects present in the environment. However… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An isovist, or viewshed, is the area in a spatial environment directly visible from a location within the space. Here we show how… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We study the problem of drawing a graph in the plane so that the vertices of the graph are rectangles that are aligned with the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Let <italic>S</italic> be a set of <italic>n</italic> non-intersecting line segments in the plane. The visibility graph <italic>G… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • S. Ghosh, D. Mount
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 14171117
The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
  • E. Welzl
  • Inf. Process. Lett.
  • 1985
  • Corpus ID: 204998001
Abstract Given a set S of line segments in the plane, its visibility graph G S is the undirected graph which has the endpoints of… Expand
  • figure 1
  • figure 3
  • figure 2
Is this relevant?