Search results

...}, [https://books.google.com/books?id=ofrBsl61lq8C&pg=PA67&dq=%22unbounded+convex+polyhedron%22&sig=ACfU3U1Yv3iG-XIn3hiuh84nK2e8UIcdAA#PPA68,M1 p. 68]</ref> ...rives from the fact that the set of all conical sum of vectors defines a [[Convex cone|cone]] (possibly in a lower-dimensional [[Linear subspace|subspace]]). ...

Two datasets are linearly separable if their [[convex hull]]s do not intersect. The method may be formulated as a [[feedforward n ...n real applications, the sets' convex hulls do intersect, and a (often non-convex) piecewise-linear discriminant can be used, through the use of several line ...

{{Short description|Convex solid with a continuous, developable surface}} .../ref> the [[convex hull|convex hulls]] of the two disc rollers (TDR convex hulls),<ref name="two disc rollers">{{cite web |last1=Ucke |first1=Christian |tit ...

.... A classical example is the problem of enumeration of the vertices of a [[convex polytope]] specified by a [[set of linear inequalities]]:<ref>[[Eric W. Wei ...inequalities given the vertices is called ''[[facet enumeration]]'' (see [[convex hull algorithms]]). ...

...vex set that are not exposed points. Therefore, not every convex face of a convex set is an exposed face.]] In [[mathematics]], most commonly in [[convex geometry]], an '''extreme set''' or '''face''' of a set <math>C\subseteq V< ...

[[File:Convex layers halfspace.svg|thumb|The convex layers of a point set and their intersection with a halfplane]] ...polygon]]s having the points as their vertices. The outermost one is the [[convex hull]] of the points and the rest are formed in the same way [[recursion|re ...

[[File:Relative convex hull.svg|thumb|The blue region is the relative convex hull of the finite set of points in the yellow simple polygon]] ...ative convex hull''' or '''geodesic convex hull''' is an analogue of the [[convex hull]] for the points inside a [[simple polygon]] or a [[Rectifiable set|re ...

#Finite sums and balanced hulls of <math>\mathcal{B}</math>-bounded sets are <math>\mathcal{B}</math>-bound ...ogy'''}} if it is stable under the formation of [[convex hull]]s (i.e. the convex hull of a bounded set is bounded) then <math>\mathcal{B}.</math> ...

...any points is it always possible to projectively transform the points into convex position?}} ...ng these points into [[convex position]] (so they form the vertices of a [[convex polytope]]).}} ...

...then there exists a subset of <math>d+2</math> points for which the convex hulls of the red and blue points in the subsets also intersect.{{r|shimrat|webste ...ed on principles related to [[Radon's theorem]] on intersections of convex hulls.{{r|webster}} However, Helly's theorem, Carathéodory's theorem, and Radon's ...

...osition if they are pairwise disjoint and none of them is contained in the convex hull of the others.{{r|tv05}} ...t solvable in [[polynomial time]] by [[dynamic programming]] for points in convex position.{{r|k80}} ...

...vid P. |author3=Huhdanpaa, Hannu |title=The quickhull algorithm for convex hulls|url = http://www.cs.princeton.edu/~dpd/Papers/BarberDobkinHuhdanpaa.pdf|jou ...vid P. |author3=Huhdanpaa, Hannu |title=The quickhull algorithm for convex hulls|url = http://www.cs.princeton.edu/~dpd/Papers/BarberDobkinHuhdanpaa.pdf|jou ...

...ime ''O''(''n''&nbsp;log&nbsp;''n''), matching the known time bounds for [[convex hull algorithms]] for Euclidean points.{{sfnp|Knuth|1992|p=47}} ...ction of an extreme vertex allows the [[Graham scan]] algorithm for convex hulls to be generalized from point sets to CC systems, with a number of queries t ...

...0.1007/978-1-4613-0019-9 |isbn=978-0-387-00424-2 |mr=1976856 |ref=Grünbaum-Convex-Polytopes<!-- Don't interfere with harv links to the other Grünbaum 2003 re Analytically, a convex polyhedron is expressed as the solution set for a system of linear inequali ...

{{short description|Convex polytope where all sets of ≤ k vertices form a face}} ...[polyhedral combinatorics]], a '''{{mvar|k}}-neighborly polytope''' is a [[convex polytope]] in which every set of {{mvar|k}} or fewer [[Vertex (geometry)|ve ...

...by [[Victor Zalgaller]], L. A. Shor, and Yu. A. Volkov, was published as ''Convex Polyhedra'' by Springer-Verlag in 2005.{{r|gorkaviy|connelly|ruane}} ...arity.{{r|busemann|gorkaviy|ruane}} It considers both bounded polyhedra ([[convex hull]]s of finite sets of points) and unbounded polyhedra (intersections of ...

== Packing and convex hulls == [[File:Sausage_packing.svg|thumb|Convex hull in blue]] ...

| title = Kinetic sorting and kinetic convex hulls ...

...e]]s, higher-dimensional generalizations of three-dimensional [[polyhedron|convex polyhedra]]. It was written by [[Branko Grünbaum]], with contributions from ''Convex Polytopes'' was the winner of the 2005 [[Leroy P. Steele Prize]] for mathem ...

...'s theorem that every point interior to the convex hull is interior to the convex hull of four points of the set.{{r|hendel}} *[[Helly's theorem]], that if a family of [[compact set|compact]] [[convex set]]s has a non-empty intersection for every triple of sets, then the whol ...