| Information | |
|---|---|
| has gloss | eng: 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. |
| lexicalization | eng: visibility graph |
| instance of | c/Geometric graphs |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint