Visibility Graph
978-613-1-11052-8
6131110522
124
2010-08-04
39.00 €
eng
https://images.our-assets.com/cover/230x230/9786131110528.jpg
https://images.our-assets.com/fullcover/230x230/9786131110528.jpg
https://images.our-assets.com/cover/2000x/9786131110528.jpg
https://images.our-assets.com/fullcover/2000x/9786131110528.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
https://morebooks.de/books/tr/published_by/betascript-publishing/1/products
Geometri
https://morebooks.de/store/tr/book/visibility-graph/isbn/978-613-1-11052-8