Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

Longer titles found: Convex hull algorithms (view), Convex hull of a simple polygon (view), Carathéodory's theorem (convex hull) (view), Orthogonal convex hull (view), Local convex hull (view), Dynamic convex hull (view), Kinetic convex hull (view), Relative convex hull (view)

searching for Convex hull 87 found (508 total)

alternate case: convex hull

Waterman butterfly projection (413 words) [view diff] exact match in snippet view article find links to article

into a corresponding convex hull, as demonstrated in the accompanying graphics. These illustrate the W5 sphere cluster, W5 convex hull, and two Waterman

complex-valued polynomial functions on G. The polynomially convex hull contains the holomorphically convex hull. The domain G {\displaystyle G} is called holomorphically

deltahedron (whose all faces are congruent equilateral triangles). The convex hull of an augmented tetrahedron is a triakis tetrahedron. Truncated triakis

following: Graham, R.L., An efficient algorithm for determining the convex hull of a finite planar set, 1972 Hyafil, L., Rivest, R.L., Constructing optimal

decagons, each alternating two different edge lengths. Together with its convex hull, it represents the snub dodecahedron-first projection of the nonuniform

two snub cubes and compound of two snub dodecahedra. Together with its convex hull, it represents the icosahedron-first projection of the nonuniform snub

effective in manipulating the convex hull of polytopic forms, and, as a result has revealed and proved the fact that convex hull manipulation is a necessary

octagons, each alternating with two edge lengths. Together with its convex hull, it represents the snub cube-first projection of the nonuniform snub

A far-enough truncation creates the compound of five octahedra. Its convex hull is a nonuniform snub dodecahedron. Cartesian coordinates for the vertices

displays the convex hull in 2D for the vector y = ( 3 , 1 ) {\displaystyle \mathbf {y} =(3,\,1)} . Notice that the center of the convex hull, which is an

convex hull of a regular polygon with an odd number of vertices. A less regular example is the cone in R3 whose base is the "house": the convex hull of

( n + 1 ) Δ n {\displaystyle K=(n+1)\Delta _{n}} is congruent to the convex hull of the vectors − ∑ i = 1 n e i {\displaystyle -\sum _{i=1}^{n}\mathbf

and is the only Schläfli-Hess polychoron to have the 120-cell for its convex hull. In this sense it is analogous to the three-dimensional great stellated

in the smallest closed ball (which is the same as the closure of its convex hull). If Γ {\displaystyle \Gamma } is the group of isometries of a Hadamard

{\text{ where }}P=\mathbb {R} +i[0,1),} and let W = {\displaystyle W=} convex hull of X {\displaystyle X} . Let f : X → C {\displaystyle f:X\to \mathbb

is the convex hull of 25 disjoint 24-cells. Each 24-cell is the convex hull of 3 disjoint (8-point) 16-cells, so the 120-cell is the convex hull of 75

collision detection Collision shapes include: sphere, box, cylinder, cone, convex hull using GJK, non-convex and triangle mesh Soft body support: cloth, rope

{\displaystyle A} is a normal matrix then W ( A ) {\displaystyle W(A)} is the convex hull of its eigenvalues. If α {\displaystyle \alpha } is a sharp point on

15 5 4 E 3 {\displaystyle {\frac {35+15{\sqrt {5}}}{4}}\,E^{3}} Its convex hull is the regular convex icosahedron. It also shares its edges with the

Ambopentachoron (Neil Sloane & John Horton Conway) (5,2)-hypersimplex (the convex hull of five-dimensional (0,1)-vectors with exactly two ones) The Cartesian

vertices, and 10 interior vertices. The 10 interior vertices have the convex hull of a pentagonal antiprism. The 80 edges project into 40 external edges

f {\displaystyle f} , i.e., Δ f = Convex Hull { j ∈ A ∣ a j ≠ 0 } . {\displaystyle \Delta _{f}={\text{Convex Hull}}\{j\in A\mid a_{j}\neq 0\}.} Then

the truncated pentacross and bitruncated penteract respectively. The convex hull of the truncated 5-cell and its dual (assuming that they are congruent)

assumes that the octagon is the convex hull of two perpendicular rectangles; then the p-gonal ditetragoltriate is the convex hull of two p-p duoprisms (where

lattice that connects CVs surrounds the surface. This is known as the convex hull property. Surface tool was originally a 3rd party plugin, but Kinetix

{\displaystyle X\otimes Y} , where W {\displaystyle W} is the balanced convex hull of the set { x ⊗ y : p ( x ) ≤ 1 , q ( y ) ≤ 1 } {\displaystyle \left\{x\otimes

{C}})}\varepsilon ^{-r(V({\mathcal {C}})-1)}} Further consider the symmetric convex hull of a set F {\displaystyle {\mathcal {F}}} : sconv ⁡ F {\displaystyle

distance to preserve the symmetry of the Platonic solid) and taking the convex hull. An example is the rhombicuboctahedron, constructed by separating the

that the image of the moment map of a Hamiltonian toric action is the convex hull of the set of moments of the points fixed by the action. In particular

should also be indicated. An empirical definition of D would be the convex hull of the points, or at least their bounding box, a matrix of the ranges

the complex zeros of the derivative of a polynomial lie inside the convex hull of the roots of the polynomial. Marden's theorem, a refinement of Gauss–Lucas

Disicositetrachoron Amboicositetrachoron (Neil Sloane & John Horton Conway) The convex hull of the rectified 24-cell and its dual (assuming that they are congruent)

parallel edges, described as 85 belts. The rhombic icosahedron forms the convex hull of the vertex-first[clarification needed] projection of a 5-cube to 3

length. A point-set triangulation is a polygon triangulation of the convex hull of a set of points. A Delaunay triangulation is another way to create

, v k ) = {\displaystyle K={\text{conv}}(v_{1},\ldots ,v_{k})=} the convex hull of its vertices. Then, deciding whether y is in K requires to check whether

obtains a bimodal distribution, which is thus not normal. In fact, the convex hull of normal distributions is dense in all distributions, so in some cases

snub dodecahedron, yet results in the same pentagonal hexecontahedron convex hull. Isohedral variations can be constructed with pentagonal faces with 3

Marden, A.; Markovic, V. (2004). "Quasiconformal homeomorphisms and the convex hull boundary" (PDF). Annals of Mathematics. 159: 305–336. doi:10.4007/annals

Marden, A; Markovic, V (2004). "Quasiconformal homeomorphisms and the convex hull boundary". Ann. of Math. 159 (2004), no. 1 (2): 305–336. doi:10.4007/annals

subset K ⊂ X {\displaystyle K\subset X} , the so-called holomorphically convex hull, K ¯ = { z ∈ X | | f ( z ) | ≤ sup w ∈ K | f ( w ) |   ∀ f ∈ O ( X )

to the input to form a pointed pseudotriangulation, removes one added convex hull edge from this graph, and shows that the remaining graph has a one-parameter

vertex figures, with edges representing faces in the 4-polytope: The convex hull of two cantellated 24-cells in opposite positions is a nonuniform polychoron

augments the input to form a pointed pseudotriangulation, removes one convex hull edge from this graph, and shows that this edge removal provides a single

transform that relates the Delaunay triangulation to the bottom half of a convex hull (i.e., giving each point p an extra coordinate equal to |p|2) shows the

detection algorithms (improved magic wand contour, polygon simplification, convex hull algorithms, polygon degree of convexity) allow to analyze the characteristics

Theoretical Computer Science, 27 (3): 241–253, doi:10.1016/0304-3975(82)90120-7, MR 0731064. Intersection of convex hull with a line with pseudo code

variance, the set of training points should contain the test point in their convex hull (see Gupta et al. reference). Instead of fitting locally linear functions

alternate characterization of a problem. Specifically, for any problem, the convex hull of the solutions is an integral polyhedron; if this polyhedron has a

MR 0561031. Graham, Ronald L.; Yao, F. Frances (1983), "Finding the convex hull of a simple polygon", Journal of Algorithms, 4 (4): 324–331, doi:10

four-dimensional polytope Skew polygon, a three-dimensional polygon whose convex hull is an antiprism Kepler, Johannes (1619). "Book II, Definition X". Harmonices

terminology is also used for the related Birkhoff polytope, defined as the convex hull of permutation matrices. More generally, V. Joseph Bowman (1972) uses

Tirasan; Pagonakis, Dimitrios; Sriswasdi, Sira (2013), "Lower Bound for Convex Hull Area and Universal Cover Problems", International Journal of Computational

of Somers' D. It is also common to calculate the Area Under the ROC Convex Hull (ROC AUCH = ROCH AUC) as any point on the line segment between two prediction

to analyze school zones identifying a "convex hull" around the furthest students' home location. The "convex hull" technique is used in geographic information

then the numerical range of their tensor product coincides with the convex hull of the product numerical range, Λ ( A ⊗ B ) = C o ( Λ ⊗ ( A ⊗ B ) )

P[{\bar {S}}]+\mathbb {R} _{+}^{q}={\mathcal {P}}} ("conv" denotes the convex hull). If MOLP is not bounded, a solution consists not only of points but

from the positive orthant facet of the cantellated 5-orthoplex. The convex hull of two cantellated 5-cells in opposite positions is a nonuniform polychoron

vectors. This amounts to approximating the feasible production set by the convex hull of observed input-output combinations. This work (Journal of the Royal

Furthermore, measuring species range, whether it is measured by the convex hull or occupancy (occurrence), is part of the percolation process and can

actually circular and he made the design flat-bottomed, unlike Elder's convex hull, to minimise its draught. Popov designed Novgorod to meet an 1869 requirement

ellipse, center of minimum distance, median center, directional mean, convex hull) Spatial autocorrelation statistics for zonal data (Moran's I, Getis's

multiple scales: the size of the actual region, 1.5x, 2x, and 3x scaled convex hull of the region. Matching is accomplished in a robust manner, so it is

functional traits functional attribute diversity (FAD); Walker et al. (1999) convex hull volume; Cornwell et al. (2006) functional diversity (FD); Petchey & Gaston

necessarily connected. For a large value, the alpha-shape is identical to the convex-hull of S. The algorithm proposed by Edelsbrunner and Mucke eliminates all

condition. For any f in L1(G), the distance between 0 and the closed convex hull in L1(G) of the left translates λ(g)f equals |∫f|. Følner condition.

coordinates. Geoprocessing: buffer, intersection, clip, dissolve, union, convex hull, difference, merge, spatial join, XY shift, reprojection, Sextante geoprocessing

actually circular and he made the design flat-bottomed, unlike Elder's convex hull, to minimise its draught. Popov's design was intended to meet an 1869

3 m (9.8 ft) long and until a recent rule change[when?] had to have a convex hull; now flat and slightly concave hulls are also allowed, although fins

relies on the observation that every doubly stochastic matrix is the convex hull of permutation matrices. For the Operations Research community, this

x+y+z=1} . Hence, the set F {\displaystyle F} of feasible agreements is the convex hull of a(60,80) and b(50,110) and c(30,150). The disagreement point is defined

share at least n points of 'identical' locations within themselves, the convex hull of which is n-dimensional, then a single planar rotation can bring one

O'Mahoney, T. G.; Kitchener, A. C.; Manning, P. L.; Sellers, W. I. (2016). "Convex-hull mass estimates of the dodo (Raphus cucullatus): application of a CT-based

diagonal vectors of an Hermitian matrix with given eigenvalues is the convex hull of all the permutations of the eigenvalues. Atiyah proved a generalization

point in the positive Weyl chamber. Then all the other points Y in the convex hull of W(X) can be obtained by a series of paths in that intersection moving

density on every prefix as Behrend's construction. By considering the convex hull of points inside a sphere, rather than the set of points on a sphere

Ikehata, M. and Siltanen, S. (2000). "Numerical method for finding the convex hull of an inclusion in conductivity from boundary measurements", Inverse

internally performs vertex enumeration during the computation of the convex hull. PolyLib and isl provide vertex enumeration on parametric polytopes,

allows to find the supported solutions of the problem (i.e. points on the convex hull of the objective set). This animation shows that when the outcome set

product functions and Linear Parameter Varying system models and to convex hull manipulation based control optimization theory, see TP model transformation

that has no other points in the intersection of the point set with its convex hull. If a hole of a given size exists, its vertices all necessarily see each

inner semi-continuous set-valued function S {\displaystyle S} , the convex hull mapping T ( x ) := c o n v ⁡ S ( x ) {\displaystyle T(x):=\mathop {\mathrm

bytes thul.adf : min. 12 bytes, depends on the number of points in the convex hull polygon tndsc.adf : 24* the number of tag entries specified in tndsc

15^{\circ }={\frac {{\sqrt {6}}-{\sqrt {2}}}{4}}\approx 0.258819} and the convex hull is precisely the regular dodecagons in the k-uniform tiling. The equilateral

approximations. It is also common to calculate the area under the TOC convex hull (ROC AUCH = ROCH AUC) as any point on the line segment between two prediction

like those of Falcon (built at the Isle of Wight in 1824) which had convex hull lines with "only slight hollows at the ends". He wrote of "wild assumptions

any other two points. (Baker 1922a, vol 1, p. 133) Newton polygon The convex hull of the points with coordinates given by the exponents of the terms of

continuity condition). (c'') For each x ∈ X {\displaystyle x\in X} , the convex hull of P i ( x ) {\displaystyle P_{i}(x)} does not contain x i {\displaystyle