Convex hull algorithms
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull.
- Comment
- enAlgorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull.
- Has abstract
- enAlgorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull.
- Is primary topic of
- Convex hull algorithms
- Label
- enConvex hull algorithms
- Link from a Wikipage to an external page
- archive.org/details/computationalgeo00berg
- www.cgal.org/Part/ConvexHullAlgorithms
- wayback.vefsafn.is/wayback/20130721095350/http:/michal.is/projects/convex%2Dhull%2Dgift%2Dwrapping%2Dmethod/
- www.qhull.org/
- web.archive.org/web/20101127013711/http:/computacion.cs.cinvestav.mx/~anzures/geom/hull.html
- Link from a Wikipage to another Wikipage
- Algebraic decision tree
- Analysis of algorithms
- Big O notation
- Category:Convex hull algorithms
- CGAL
- Chan's algorithm
- Charles E. Leiserson
- Clifford Stein
- Computational geometry
- Computer science
- Convex function
- Convex hull
- Convex polygon
- Convex polyhedron
- Convex polytope
- Data structure
- David G. Kirkpatrick
- Decision tree model
- Divide and conquer (Convex Hull)
- Dynamic convex hull
- Face (geometry)
- Franco P. Preparata
- G. T. Toussaint
- Gift wrapping algorithm
- Graham scan
- Half-space (geometry)
- Integer sorting
- Introduction to Algorithms
- Kirkpatrick–Seidel algorithm
- Linear time
- LP-type problem
- Mathematics
- Monotone chain
- Orthogonal convex hull
- Output-sensitive algorithm
- Parabola
- Quadrilateral
- Quickhull
- Quicksort
- Raimund Seidel
- Reduction (complexity)
- Ronald Graham
- Ronald L. Rivest
- S.J. Hong
- Selim Akl
- Simple polygon
- Sorting
- Springer-Verlag
- Stack (abstract data type)
- Thomas H. Cormen
- Timothy M. Chan
- Ultimate convex hull algorithm
- SameAs
- 4iMfp
- Calcul de l'enveloppe convexe
- Convex hull algorithms
- m.02rpg18
- Q5166520
- Алгоритми обчислення опуклої оболонки
- Алгоритмы построения выпуклой оболочки
- الگوریتمهای پوش محدب
- خوارزمية الهيكل المحدب
- 凸包アルゴリズム
- 볼록 껍질 알고리즘
- Subject
- Category:Convex hull algorithms
- Title
- enConvex Hull
- Urlname
- enConvexHull
- WasDerivedFrom
- Convex hull algorithms?oldid=1123252177&ns=0
- WikiPageLength
- 16451
- Wikipage page ID
- 11700432
- Wikipage revision ID
- 1123252177
- WikiPageUsesTemplate
- Template:Cite book
- Template:Harvtxt
- Template:ISBN
- Template:Main
- Template:MathWorld
- Template:Reflist
- Template:Short description
- Template:Wikibooks