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.
2011
2011
On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain
2008
2008
Development and laboratory validation of in-line multiplexed low-coherence interferometric sensors
2005
2005
Query processing in spatial databases containing obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in… 
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… 
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… 
1995
1995
Growing a Tree from Its Branches
Given a set L of n disjoint line segments in the plane, we show that it is always possible to form a spanning tree of the… 
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
Shortest path planning in discretized workspaces using dominance relation
A method of partitioning a workspace using rectilinear visibility in 3-D or higher space is presented. Unlike the case of 2-D… 
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)