Andere Kunden interessierten sich auch für
![Visibility (Geometry)]( "Visibility (Geometry)")
Visibility (Geometry)19,99 €![Restricted-Orientation Convexity]( "Restricted-Orientation Convexity")
Restricted-Orientation Convexity41,99 €![Erd's Diophantine Graph]( "Erd's Diophantine Graph")
Erd's Diophantine Graph22,99 €![Graph Drawing]( "Graph Drawing")
Graph Drawing29,99 €![Petersen Graph]( "Petersen Graph")
Petersen Graph25,99 €![String Graph]( "String Graph")
String Graph25,99 €![Dual Graph]( "Dual Graph")
Dual Graph25,99 €
High Quality Content by WIKIPEDIA articles! 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.