Visibility (geometry)

<h2 id="concepts-and-problems">Concepts and problems</h2>
<ul><li>Point visibility</li>
<li>Edge visibility<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a></li>
<li><a href="/facts/Visibility_polygon/tytYfhQ4">Visibility polygon</a></li>
<li>Weak visibility</li>
<li><a href="/facts/Art_gallery_problem/Ytg00bIU">Art gallery problem</a> or museum problem</li>
<li><a href="/facts/Visibility_graph/kEaHTj2A">Visibility graph</a>
<ul><li>Visibility graph of vertical line segments</li></ul></li>
<li><a href="/facts/Watchman_route_problem/G566Uc2X">Watchman route problem</a></li>
<li>Computer graphics applications:
<ul><li><a href="/facts/Hidden_surface_determination/hk9dqmDE">Hidden surface determination</a></li>
<li><a href="/facts/Hidden_line_removal/oflyG52x">Hidden line removal</a></li>
<li><a href="/facts/Z-buffering/HTyzcKbx">z-buffering</a></li>
<li><a href="/facts/Portal_engine/B2rGDC0s">portal engine</a></li></ul></li>
<li><a href="/facts/Star-shaped_polygon/yW0cSRzz">Star-shaped polygon</a>
<ul><li>Kernel of a polygon</li></ul></li>
<li><a href="/facts/Isovist/NCUzFr58">Isovist</a></li>
<li><a href="/facts/Viewshed/XXhjrKGz">Viewshed</a></li>
<li><a href="/facts/Zone_of_Visual_Influence/XXhjrKGz">Zone of Visual Influence</a></li>
<li><a href="/facts/Painter%27s_algorithm/rA9wMkaA">Painter's algorithm</a></li></ul>

<ul><li><a href="/facts/Joseph_O%27Rourke_(professor)/4katVCtw">O'Rourke, Joseph</a> (1987). <a href="/facts/Art_Gallery_Theorems_and_Algorithms/Xn8mfMqU"><i>Art Gallery Theorems and Algorithms</i></a>. <a href="/facts/Oxford_University_Press/CYyTzzWG">Oxford University Press</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-19-503965-3.</li>
<li>Ghosh, Subir Kumar (2007). <i>Visibility Algorithms in the Plane</i>. <a href="/facts/Cambridge_University_Press/fgEBSSRq">Cambridge University Press</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-521-87574-5.</li>
<li><a href="/facts/Mark_de_Berg/SQt9z1vg">Mark de Berg</a>, <a href="/facts/Marc_van_Kreveld/Q26nPFw1">Marc van Kreveld</a>, <a href="/facts/Mark_Overmars/4MzGpDBq">Mark Overmars</a>, and <a href="/facts/Otfried_Schwarzkopf/pE2cx5Qx">Otfried Schwarzkopf</a> (2000). <i>Computational Geometry</i> (2nd revised ed.). <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-65620-0. 1st edition (1987).{{cite book}}:  CS1 maint: multiple names: authors list (link) Chapter 15: "Visibility graphs"</li></ul>

<h2 id="external-links">External links</h2>
<h3>Software</h3>
<ul><li><a href="http://www.VisiLibity.org">VisiLibity: A free open source C++ library of floating-point visibility algorithms and supporting data types</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transactions on Computers, vol. C-30, No. 12, December 1981, pp. 910-914. <a href="https://www.computer.org/csdl/trans/tc/1981/12/01675729-abs.html" target="_blank">https://www.computer.org/csdl/trans/tc/1981/12/01675729-abs.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>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. <a href="https://mediatum.ub.tum.de/doc/1289339/file.pdf" target="_blank">https://mediatum.ub.tum.de/doc/1289339/file.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Visibility (geometry) open-in-new

Visibility (geometry)