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… … Wikipedia
Visibility graph — A visibility graph is a graph of intervisible locations. Each node or vertex in the graph represents a point location, and each edge represents a visible connection between them (that is, if two locations can see each other, an edge is drawn… … Wikipedia
Star-shaped polygon — A star shaped polygon (not to be confused with star polygon) is a polygonal region in the plane which is a star domain, i.e., a polygon P is star shaped, if there exists a point z such that for each point p of P the segment zp lies entirely… … Wikipedia
Rectilinear polygon — Some examples of rectilinear polygons A rectilinear polygon is a polygon all of whose edges meet at right angles. Thus the interior angle at each vertex is either 90° or 270°. Rectilinear polygons are a special case of isothetic polygons. In many … Wikipedia
Space syntax — The term space syntax encompasses a set of theories and techniques for the analysis of spatial configurations. Originally it was conceived by Bill Hillier, Julienne Hanson and colleagues at The Bartlett, University College London in the late… … Wikipedia
List of mathematics articles (V) — NOTOC Vac Vacuous truth Vague topology Valence of average numbers Valentin Vornicu Validity (statistics) Valuation (algebra) Valuation (logic) Valuation (mathematics) Valuation (measure theory) Valuation of options Valuation ring Valuative… … Wikipedia
Potentially visible set — Potentially Visible Sets are used to accelerate the rendering of 3D environments. This is a form of occlusion culling, whereby a candidate set of potentially visible polygons are pre computed, then indexed at run time in order to quickly obtain… … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
