Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Any-angle path planningArt gallery problemComputational geometryDijkstra's algorithm

Broader (1)

Robot control

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
VisExpA: Visibility expansion algorithm in the topology of complex networks
2013
2013
GOAL: A parsimonious geographic routing protocol for large scale sensor networks
2011
2011
On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain
2006
2006
Thickness of Bar 1-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments… 
2005
2005
The design of a hardware accelerator for real-time complete visibility graph construction and efficient FPGA implementation
A valuable geometric structure in mobile robot path planning is the complete visibility graph. This letter proposes new parallel… 
1999
1999
Motion planning using the modified visibility graph
We consider the problem of planning robot motion in a plane with two constraints on the trajectory: being short and comfortable… 
1998
1998
Open Problems in the Combinatorics of Visibility and Illumination
1991 Primary 52C99. Visibility, illumination, visibility graphs, computational geometry. Supported by NSF grant CCR-9421670. URL… 
1997
1997
The visibility graph contains a bounded-degree spanner
Given a collection of polygonal obstacles with n vertices on the place, and any t > 1, we present an O(n logn) time algorithm… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1991
1991
An efficient algorithm for finding a two-pair, and its applications
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)