Visibility (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 isn't 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

References

  1. D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transactions Computers, vol. C-30, No. 12, December 1981, pp. 910-914.
  2. E. Roth, G. Panin and A. Knoll, "Sampling feature points for contour tracking with graphics hardware", "In International Workshop on Vision, Modeling and Visualization (VMV)", Konstanz, Germany, October 2008.

External links

Software


This article is issued from Wikipedia - version of the Saturday, April 16, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.