Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1311-1052-8 |
Объём: | 124 страниц |
Масса: | 209 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
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.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.