Live briefing
Everything about Visibility graph
Graph of intervisible locations in computational geometry
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents a point location, and each edge represents a visible connection between them. That is, if the line segment connecting two locations does not pass through any obstacle, an edge is drawn between them in the graph. When the set of locations lies in a line, this can be understood as an ordered series. Visibility graphs have therefore been extended to the realm of time series analysis. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Visibility graphA 5-minute orientation
- Skim a recent paper: AvgNet: Adaptive Visibility Graph Neural Network and Its Application in Modulation ClassificationInfluential work since 2022
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: From time series to complex networks: The visibility graphCited 1,676 times
- Go sideways: Euclidean shortest pathA closely related topic
- Go sideways: BitangentA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
From time series to complex networks: The visibility graph
Time series irreversibility: a visibility graph approach
Visibility, occlusion, and the aspect graph
Visibility graph approach to exchange rate series
Visibility Graph Based Time Series Analysis
An optimal visibility graph algorithm for triangulated simple polygons
Sequential visibility-graph motifs
Visibility graph analysis of wall turbulence time-series
🆕 Influential since 2022
AvgNet: Adaptive Visibility Graph Neural Network and Its Application in Modulation Classification
Visibility graph for time series prediction and image classification: a review
SimVGNets: Similarity-Based Visibility Graph Networks for Carbon Price Forecasting
A Review of Visibility Graph Analysis
Phase space visibility graph
đź“š Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
Language and Automata Theory and ApplicationsAdrian-Horia Dediu · 2012
Trends and Topics in Computer VisionKiriakos N. Kutulakos · 2012- 📕Xcelsius 2008 dashboard best practicesLoren Abdulezer · 2008
Drupal 7 bibleRic Shreves · 2011
Graph DrawingWalter Didimo · 2013
Programming Game AI by ExampleMat Buckland · 2004
Computational GeometryAlberto Márquez · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Euclidean shortest path The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find…
- Bitangent In geometry, a bitangent to a curve C is a line L that touches C in two distinct points P and Q and that has the same direction as C at these points. That…
- Simple polygon In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting of…
- John Hershberger John E. Hershberger (born 1959) is an American computer scientist and software professional, a principal engineer at Mentor Graphics Corporation since…
- Pseudotriangle In Euclidean plane geometry, a pseudotriangle (pseudo-triangle) is the simply connected subset of the plane that lies between any three mutually tangent…
- Visibility (geometry) In geometry, visibility is a mathematical abstraction of the real-life notion of visibility. Given a set of obstacles in the Euclidean space, two points…
- Visibility polygon In computational geometry, the visibility polygon or visibility region for a point p in the plane among obstacles is the possibly unbounded polygonal region…
- Computational geometry Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical…