- Source: Visibility (geometry)
In geometry, visibility is a mathematical abstraction of the real-life notion of visibility.
Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect any obstacles. (In the Earth's atmosphere light follows a slightly curved path that is not perfectly predictable, complicating the calculation of actual visibility.)
Computation of visibility is among the basic problems in computational geometry and has applications in computer graphics, motion planning, and other areas.
Concepts and problems
Point visibility
Edge visibility
Visibility polygon
Weak visibility
Art gallery problem or museum problem
Visibility graph
Visibility graph of vertical line segments
Watchman route problem
Computer graphics applications:
Hidden surface determination
Hidden line removal
z-buffering
portal engine
Star-shaped polygon
Kernel of a polygon
Isovist
Viewshed
Zone of Visual Influence
Painter's algorithm
References
O'Rourke, Joseph (1987). Art Gallery Theorems and Algorithms. Oxford University Press. ISBN 0-19-503965-3.
Ghosh, Subir Kumar (2007). Visibility Algorithms in the Plane. Cambridge University Press. ISBN 978-0-521-87574-5.
Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf (2000). Computational Geometry (2nd revised ed.). Springer-Verlag. ISBN 3-540-65620-0. 1st edition (1987).{{cite book}}: CS1 maint: multiple names: authors list (link) Chapter 15: "Visibility graphs"
External links
= Software
=VisiLibity: A free open source C++ library of floating-point visibility algorithms and supporting data types
Kata Kunci Pencarian:
- Visibility (geometry)
- Visibility graph
- Visibility (disambiguation)
- Clipping (computer graphics)
- Computational geometry
- Visibility polygon
- Discrete geometry
- List of combinatorial computational geometry topics
- Viewshed
- Hidden-surface determination
