Faster access than browser!
48 relations: Analysis of algorithms, Big O notation, CGAL, Chan's algorithm, Charles E. Leiserson, Clifford Stein, Computational geometry, Computational Geometry (journal), Computer science, Convex function, Convex hull, Convex polygon, Convex polytope, Data structure, David G. Kirkpatrick, David Mount, Decision tree model, Dynamic convex hull, Face (geometry), Franco P. Preparata, Gift wrapping algorithm, Godfried Toussaint, Graham scan, Half-space (geometry), Integer sorting, Introduction to Algorithms, Kirkpatrick–Seidel algorithm, Luc Devroye, Mark Overmars, Mathematics, Orthogonal convex hull, Otfried Cheong, Output-sensitive algorithm, Parabola, Quadrilateral, Quickhull, Quicksort, Raimund Seidel, Reduction (complexity), Ron Rivest, Ronald Graham, Selim Akl, Simple polygon, Sorting, Springer Science+Business Media, Thomas H. Cormen, Time complexity, Timothy M. Chan.
Analysis of algorithms
In computer science, the analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them.
New!!: Convex hull algorithms and Analysis of algorithms · See more »
Big O notation
Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.
New!!: Convex hull algorithms and Big O notation · See more »
CGAL
The Computational Geometry Algorithms Library (CGAL) is a software library of computational geometry algorithms.
New!!: Convex hull algorithms and CGAL · See more »
Chan's algorithm
In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P of n points, in 2- or 3-dimensional space.
New!!: Convex hull algorithms and Chan's algorithm · See more »
Charles E. Leiserson
Charles Eric Leiserson is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof.
New!!: Convex hull algorithms and Charles E. Leiserson · See more »
Clifford Stein
Clifford Seth Stein (born December 14, 1965), a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science.
New!!: Convex hull algorithms and Clifford Stein · 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!!: Convex hull algorithms and Computational geometry · See more »
Computational Geometry (journal)
Computational Geometry, also known as Computational Geometry: Theory and Applications, is a peer-reviewed mathematics journal for research in theoretical and applied computational geometry, its applications, techniques, and design and analysis of geometric algorithms.
New!!: Convex hull algorithms and Computational Geometry (journal) · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Convex hull algorithms and Computer science · See more »
Convex function
In mathematics, a real-valued function defined on an ''n''-dimensional interval is called convex (or convex downward or concave upward) if the line segment between any two points on the graph of the function lies above or on the graph, in a Euclidean space (or more generally a vector space) of at least two dimensions.
New!!: Convex hull algorithms and Convex function · See more »
Convex hull
In mathematics, the convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X., p. 3.
New!!: Convex hull algorithms and Convex hull · See more »
Convex polygon
A convex polygon is a simple polygon (not self-intersecting) in which no line segment between two points on the boundary ever goes outside the polygon.
New!!: Convex hull algorithms and Convex polygon · See more »
Convex polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn.
New!!: Convex hull algorithms and Convex polytope · See more »
Data structure
In computer science, a data structure is a data organization and storage format that enables efficient access and modification.
New!!: Convex hull algorithms and Data structure · See more »
David G. Kirkpatrick
David Galer Kirkpatrick is a Professor Emeritus of computer science at the University of British Columbia.
New!!: Convex hull algorithms and David G. Kirkpatrick · See more »
David Mount
David Mount is a professor at University of Maryland Department of Computer Science (College Park Campus) whose research is in computational geometry.
New!!: Convex hull algorithms and David Mount · See more »
Decision tree model
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence of branching operations based on comparisons of some quantities, the comparisons being assigned the unit computational cost.
New!!: Convex hull algorithms and Decision tree model · See more »
Dynamic convex hull
The dynamic convex hull problem is a class of dynamic problems in computational geometry.
New!!: Convex hull algorithms and Dynamic convex hull · See more »
Face (geometry)
In solid geometry, a face is a flat (planar) surface that forms part of the boundary of a solid object; a three-dimensional solid bounded exclusively by flat faces is a polyhedron.
New!!: Convex hull algorithms and Face (geometry) · See more »
Franco P. Preparata
Franco P. Preparata is a computer scientist, the An Wang Professor, Emeritus, of Computer Science at Brown University.
New!!: Convex hull algorithms and Franco P. Preparata · See more »
Gift wrapping algorithm
In computational geometry, the gift wrapping algorithm is an algorithm for computing the convex hull of a given set of points.
New!!: Convex hull algorithms and Gift wrapping algorithm · 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!!: Convex hull algorithms and Godfried Toussaint · See more »
Graham scan
Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n).
New!!: Convex hull algorithms and Graham scan · See more »
Half-space (geometry)
In geometry, a half-space is either of the two parts into which a plane divides the three-dimensional Euclidean space.
New!!: Convex hull algorithms and Half-space (geometry) · See more »
Integer sorting
In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer.
New!!: Convex hull algorithms and Integer sorting · See more »
Introduction to Algorithms
Introduction to Algorithms is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
New!!: Convex hull algorithms and Introduction to Algorithms · See more »
Kirkpatrick–Seidel algorithm
The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm", is an algorithm for computing the convex hull of a set of points in the plane, with \mathcal(n \log h) time complexity, where n is the number of input points and h is the number of points (non dominated or maximal points, as called in some texts) in the hull.
New!!: Convex hull algorithms and Kirkpatrick–Seidel algorithm · See more »
Luc Devroye
Luc P. Devroye is a Belgian computer scientist and mathematician and a James McGill Professor in the School of Computer Science of McGill University in Montreal, Quebec, Canada.
New!!: Convex hull algorithms and Luc Devroye · See more »
Mark Overmars
Markus Hendrik "Mark" Overmars (born 29 September 1958 in Zeist, Netherlands) is a Dutch computer scientist and teacher of game programming known for his game development application Game Maker.
New!!: Convex hull algorithms and Mark Overmars · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Convex hull algorithms and Mathematics · See more »
Orthogonal convex hull
In geometry, a set is defined to be orthogonally convex if, for every line that is parallel to one of standard basis vectors, the intersection of with is empty, a point, or a single segment.
New!!: Convex hull algorithms and Orthogonal convex hull · See more »
Otfried Cheong
Otfried Cheong (formerly Otfried Schwarzkopf) is a German computational geometer working in South Korea at KAIST.
New!!: Convex hull algorithms and Otfried Cheong · See more »
Output-sensitive algorithm
In computer science, an output-sensitive algorithm is an algorithm whose running time depends on the size of the output, instead of, or in addition to, the size of the input.
New!!: Convex hull algorithms and Output-sensitive algorithm · See more »
Parabola
In mathematics, a parabola is a plane curve which is mirror-symmetrical and is approximately U-shaped.
New!!: Convex hull algorithms and Parabola · See more »
Quadrilateral
In Euclidean plane geometry, a quadrilateral is a polygon with four edges (or sides) and four vertices or corners.
New!!: Convex hull algorithms and Quadrilateral · See more »
Quickhull
Quickhull is a method of computing the convex hull of a finite set of points in the plane.
New!!: Convex hull algorithms and Quickhull · See more »
Quicksort
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
New!!: Convex hull algorithms and Quicksort · See more »
Raimund Seidel
Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.
New!!: Convex hull algorithms and Raimund Seidel · See more »
Reduction (complexity)
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem.
New!!: Convex hull algorithms and Reduction (complexity) · See more »
Ron Rivest
Ronald Linn Rivest (born May 6, 1947) is a cryptographer and an Institute Professor at MIT.
New!!: Convex hull algorithms and Ron Rivest · See more »
Ronald Graham
Ronald Lewis "Ron" Graham (born October 31, 1935) is an American mathematician credited by the American Mathematical Society as being "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years".
New!!: Convex hull algorithms and Ronald Graham · See more »
Selim Akl
Selim G. Akl (Ph.D., McGill University, 1978) is a professor at Queen's University in the Queen's School of Computing, where he leads the.
New!!: Convex hull algorithms and Selim Akl · 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!!: Convex hull algorithms and Simple polygon · See more »
Sorting
Sorting is any process of arranging items systematically, and has two common, yet distinct meanings.
New!!: Convex hull algorithms and Sorting · See more »
Springer Science+Business Media
Springer Science+Business Media or Springer, part of Springer Nature since 2015, is a global publishing company that publishes books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing.
New!!: Convex hull algorithms and Springer Science+Business Media · See more »
Thomas H. Cormen
Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein.
New!!: Convex hull algorithms and Thomas H. Cormen · 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!!: Convex hull algorithms and Time complexity · See more »
Timothy M. Chan
Timothy Moon-Yew Chan is a Founder Professor, U. Illinois, retrieved January 18, 2017.
New!!: Convex hull algorithms and Timothy M. Chan · See more »
References
[1] https://en.wikipedia.org/wiki/Convex_hull_algorithms
