In computational geometry and robot motion planning,[1] 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.
^Niu, Hanlin; Savvaris, Al; Tsourdos, Antonios; Ji, Ze (2019). "Voronoi-Visibility Roadmap-based Path Planning Algorithm for Unmanned Surface Vehicles" (PDF). Journal of Navigation. 72 (4): 850–874. doi:10.1017/S0373463318001005. ISSN 0373-4633. S2CID 67908628.
a visibilitygraph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents...
architecture, visibilitygraph analysis (VGA) is a method of analysing the inter-visibility connections within buildings or urban networks. Visibilitygraph analysis...
while preserving outerplanarity, are also chordal graphs and visibilitygraphs. Outerplanar graphs were first studied and named by Chartrand & Harary...
test efficiently whether an undirected graph can be represented as a visibilitygraph. A partial cube is a graph for which the vertices can be associated...
point sets, constructive solid geometry formulas for polygons, and visibilitygraphs of polygons. A simple polygon is a closed curve in the Euclidean plane...
groups as subclasses. A visibility member, for example, would be a feature of a layer, but not necessarily of a group. Scene graphs are useful for modern...
project include the A* search algorithm, the Hough transform, and the visibilitygraph method. Shakey was developed from approximately 1966 through 1972 with...
and Wiener, 2005). When applied to such architecture, isovists and visibilitygraph measurands are further analysed to predict spatial behaviour of the...
performing a shortest path algorithm such as Dijkstra's algorithm on a visibilitygraph derived from the obstacles or (in an approach called the continuous...
mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...
investigated. In recent research, heart beat detection methods based on visibilitygraphs have been introduced, enabling fast and sample-precise R-peak annotation...
graphs that can occur as distance-regular circulant graphs. Agarwal et al. (1994) describe polygons that have crown graphs as their visibilitygraphs;...
Arabacioglu (2010) from the architectural theories of space syntax and visibilitygraph analysis, and is applied with the help of a fuzzy system with a Mamdami...
by applying Dijkstra's algorithm to a subgraph of the visibilitygraph formed by the visibility edges that lie on bitangent lines (Rohnert 1986). A bitangent...
polytope, unit disk graphs, and visibilitygraphs. Topics in this area include: Graph drawing Polyhedral graphs Random geometric graphs Voronoi diagrams...
guarded is equivalent to solving the dominating set problem on the visibilitygraph of the polygon. Chvátal's art gallery theorem, named after Václav Chvátal...
number of connected components. Point robots among polygonal obstacles Visibilitygraph Cell decomposition Translating objects among obstacles Minkowski sum...
Turner of UCL. This software initially generated isovists and performed visibilitygraph analysis of building systems on computers running Windows. It evolved...
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional...
Delaunay triangulation Voronoi diagram Visibility (geometry) Art gallery problem (The museum problem) Visibilitygraph Watchman route problem Computer graphics...
hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two...