Visibility polygon
From Wikipedia, the free encyclopedia
The visibility polygon or visibility region for a point p in the plane among non-transparent obstacles is the possibly unbounded polygonal region of all points of the plane visible from p.
If the visibility polygon is bounded then it is a star-shaped polygon. This is the case, e.g., if the obstacles are the edges of a polygon and p is inside the polygon. In the latter case the visibility polygon may be found in linear time.[1]
Visibility polygons are studied in computational geometry and find their applications in motion planning.
External links
http://web.informatik.uni-bonn.de/I/GeomLab/VisPolygon/index.html.en (visibility in simple polygons - applets)
Software
- VisiLibity: A free open source C++ library of floating-point visibility algorithms and supporting data types, calculates visibility polygons in polygonal environments with polygonal holes
References
- ↑ Franco P. Preparata and Michael Ian Shamos (1985). Computational Geometry - An Introduction. Springer-Verlag. 1st edition: ISBN 0-387-96131-3; 2nd printing, corrected and expanded, 1988: ISBN 3-540-96131-3; Russian translation, 1989: ISBN 5-03-001041-6.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.