Faster access than browser!
36 relations: Anna Lubiw, Approximation algorithm, Art museum, Bernard Chazelle, Computational geometry, Daniel Kleitman, Decision problem, Divide and conquer algorithm, Dominating set, Dual graph, Existential theory of the reals, Godfried Toussaint, Graph (discrete mathematics), Graph coloring, Jörg-Rüdiger Sack, Line segment, Logarithm, Maria Klawe, Mathematical induction, NP-hardness, Point (geometry), Polygon triangulation, Polyhedron, Proofs from THE BOOK, Rectilinear polygon, Set cover problem, Simple polygon, SWAT and WADS conferences, Time complexity, Tree (graph theory), Upper and lower bounds, Václav Chvátal, VC dimension, Victor Klee, Visibility (geometry), Visibility graph.
Anna Lubiw
Anna Lubiw is a computer scientist known for her work in computational geometry and graph theory.
New!!: Art gallery problem and Anna Lubiw · See more »
Approximation algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to NP-hard optimization problems with provable guarantees on the distance of the returned solution to the optimal one.
New!!: Art gallery problem and Approximation algorithm · See more »
Art museum
An art museum or art gallery is a building or space for the exhibition of art, usually visual art.
New!!: Art gallery problem and Art museum · See more »
Bernard Chazelle
Bernard Chazelle (born November 5, 1955) is a French-American computer scientist.
New!!: Art gallery problem and Bernard Chazelle · See more »
Computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
New!!: Art gallery problem and Computational geometry · See more »
Daniel Kleitman
Daniel J. Kleitman (born October 4, 1934) is a professor of applied mathematics at MIT.
New!!: Art gallery problem and Daniel Kleitman · See more »
Decision problem
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
New!!: Art gallery problem and Decision problem · See more »
Divide and conquer algorithm
In computer science, divide and conquer is an algorithm design paradigm based on multi-branched recursion.
New!!: Art gallery problem and Divide and conquer algorithm · See more »
Dominating set
In graph theory, a dominating set for a graph G.
New!!: Art gallery problem and Dominating set · See more »
Dual graph
In the mathematical discipline of graph theory, the dual graph of a plane graph is a graph that has a vertex for each face of.
New!!: Art gallery problem and Dual graph · See more »
Existential theory of the reals
In mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form where F(X_1,\dots X_n) is a quantifier-free formula involving equalities and inequalities of real polynomials.
New!!: Art gallery problem and Existential theory of the reals · See more »
Godfried Toussaint
Godfried T. Toussaint is a Canadian Computer Scientist, a Professor of Computer Science, and the Head of the Computer Science Program at New York University Abu Dhabi (NYUAD) in Abu Dhabi, United Arab Emirates.
New!!: Art gallery problem and Godfried Toussaint · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Art gallery problem and Graph (discrete mathematics) · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Art gallery problem and Graph coloring · See more »
Jörg-Rüdiger Sack
Jörg-Rüdiger Wolfgang Sack (born in Duisburg, Germany) is a professor of computer science at Carleton University, where he holds the SUN–NSERC chair in Applied Parallel Computing.
New!!: Art gallery problem and Jörg-Rüdiger Sack · See more »
Line segment
In geometry, a line segment is a part of a line that is bounded by two distinct end points, and contains every point on the line between its endpoints.
New!!: Art gallery problem and Line segment · See more »
Logarithm
In mathematics, the logarithm is the inverse function to exponentiation.
New!!: Art gallery problem and Logarithm · See more »
Maria Klawe
Maria Margaret Klawe (born 1951) is a computer scientist and the fifth president of Harvey Mudd College (since July 1, 2006).
New!!: Art gallery problem and Maria Klawe · See more »
Mathematical induction
Mathematical induction is a mathematical proof technique.
New!!: Art gallery problem and Mathematical induction · See more »
NP-hardness
NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".
New!!: Art gallery problem and NP-hardness · See more »
Point (geometry)
In modern mathematics, a point refers usually to an element of some set called a space.
New!!: Art gallery problem and Point (geometry) · See more »
Polygon triangulation
In computational geometry, polygon triangulation is the decomposition of a polygonal area (simple polygon) P into a set of triangles, Chapter 3: Polygon Triangulation: pp.45–61.
New!!: Art gallery problem and Polygon triangulation · See more »
Polyhedron
In geometry, a polyhedron (plural polyhedra or polyhedrons) is a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices.
New!!: Art gallery problem and Polyhedron · See more »
Proofs from THE BOOK
Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler.
New!!: Art gallery problem and Proofs from THE BOOK · See more »
Rectilinear polygon
A rectilinear polygon is a polygon all of whose edge intersections are at right angles.
New!!: Art gallery problem and Rectilinear polygon · See more »
Set cover problem
The set cover problem is a classical question in combinatorics, computer science and complexity theory.
New!!: Art gallery problem and Set cover problem · See more »
Simple polygon
In geometry a simple polygon is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pair-wise to form a closed path.
New!!: Art gallery problem and Simple polygon · See more »
SWAT and WADS conferences
WADS, the Algorithms and Data Structures Symposium, is an international academic conference in the field of computer science, focusing on algorithms and data structures.
New!!: Art gallery problem and SWAT and WADS conferences · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Art gallery problem and Time complexity · See more »
Tree (graph theory)
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.
New!!: Art gallery problem and Tree (graph theory) · See more »
Upper and lower bounds
In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (K, ≤) is an element of K which is greater than or equal to every element of S. The term lower bound is defined dually as an element of K which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.
New!!: Art gallery problem and Upper and lower bounds · See more »
Václav Chvátal
Václav (Vašek) Chvátal (is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Canada. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.
New!!: Art gallery problem and Václav Chvátal · See more »
VC dimension
In Vapnik–Chervonenkis theory, the VC dimension (for Vapnik–Chervonenkis dimension) is a measure of the capacity (complexity, expressive power, richness, or flexibility) of a space of functions that can be learned by a statistical classification algorithm.
New!!: Art gallery problem and VC dimension · See more »
Victor Klee
Victor L. Klee, Jr. (September 18, 1925, San Francisco – August 17, 2007, Lakewood, Ohio) was a mathematician specialising in convex sets, functional analysis, analysis of algorithms, optimization, and combinatorics.
New!!: Art gallery problem and Victor Klee · See more »
Visibility (geometry)
Visibility in geometry is a mathematical abstraction of the real-life notion of visibility.
New!!: Art gallery problem and Visibility (geometry) · See more »
Visibility graph
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane.
New!!: Art gallery problem and Visibility graph · See more »
Redirects here:
Art gallery theorem, Art gallery theorems, Chvatal art gallery theorem, Chvatal's art gallery theorem, Chvátal art gallery theorem, Chvátal's art gallery theorem, Museum guard problem, The museum problem.
References
[1] https://en.wikipedia.org/wiki/Art_gallery_problem
