No results for "Convex hulls" (auto) in titles.

Suggestions for article titles:

1. Convex hull: of a set $M$ The minimal convex set containing $M$; it is the intersection of all convex sets containing $M$. The convex hull of a set $M$ is denoted by $\operatorname{conv} M$. (Mathematics) [100%] 2023-10-28 [Geometry]
2. Convex: Convex, a term for the exterior side of a curved or rounded surface, as opposed to “concave” (Lat. con-, and cavus, hollow), the inner surface. [89%] 2022-09-02
3. 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 ... (Class of algorithms in computational geometry) [81%] 2022-07-21 [Convex hull algorithms]
4. Relative convex hull: In discrete geometry and computational geometry, the relative convex hull or geodesic convex hull is an analogue of the convex hull for the points inside a simple polygon or a rectifiable simple closed curve. Let \displaystyle{ P }[/math] be a ... [81%] 2023-03-11 [Convex hulls]
5. Relative convex hull: In discrete geometry and computational geometry, the relative convex hull or geodesic convex hull is an analogue of the convex hull for the points inside a simple polygon or a rectifiable simple closed curve. Let P {\displaystyle P} be a ... [81%] 2022-07-06 [Convex hulls]
6. Orthogonal convex hull: In geometry, a set K ⊂ R is defined to be orthogonally convex if, for every line L that is parallel to one of standard basis vectors, the intersection of K with L is empty, a point, or a single segment ... (Minimal superset that intersects each axis-parallel line in an interval) [81%] 2022-07-30 [Convex hulls]
7. P-convex hull: For p {\displaystyle p} -norms are a generalization of norms. The definition requires the notion of (absolute) p {\displaystyle p} -convex hull (see Köthe 1966). [81%] 2023-04-07 [Wiki2Reveal] [Linear algebra]...
8. Dynamic convex hull: The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for input data undergoing a sequence of discrete changes, i.e., when ... [81%] 2022-08-25 [Convex hull algorithms]
9. 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 ... (Class of algorithms in computational geometry) [81%] 2024-10-04 [Convex hull algorithms]
10. Orthogonal convex hull: In geometry, a set K ⊂ R is defined to be orthogonally convex if, for every line L that is parallel to one of standard basis vectors, the intersection of K with L is empty, a point, or a single segment ... (Minimal superset that intersects each axis-parallel line in an interval) [81%] 2025-01-28 [Convex hulls]
11. Connex: Clebsch connex A connection between the points and lines of the plane expressible by the equation $$ \tag{1 } f ( x ^ {1} , x ^ {2} , x ^ {3} , u _ {1} ,\ u _ {2} , u _ {3} ) = 0 , $$ where $ x ^ {i} $ and $ u ... (Mathematics) [74%] 2023-10-22
12. Convex game: A non-cooperative game for $n$ persons with a non-empty set of players $A$ such that for each player $i\in A$ the set of his pure strategies $X_i$ is convex, while the pay-off function (cf. Gain function ... (Mathematics) [63%] 2023-10-17
13. Convex integration: One of the methods developed by M. Gromov to prove the $h$-principle. (Mathematics) [63%] 2023-10-21
14. Convex combination: In convex geometry and vector algebra, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points in an affine space) where all coefficients are non-negative and sum to 1. In other ... (Linear combination of points where all coefficients are non-negative and sum to 1) [63%] 2023-11-12 [Convex geometry] [Convex hulls]...
15. Convex functional: A functional, defined on a convex subset of a linear vector space, the supergraph of which is a convex set. A functional which does not assume the value on a convex set is convex on if and only if the ... (Mathematics) [63%] 2023-10-17
16. Convex cone: A convex body $V$ consisting of half-lines issuing from one point — the apex of the cone. The case when $V$ is identical with the entire space is excluded from this definition. (Mathematics) [63%] 2023-09-24
17. Convex set: In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex ... (In geometry, set whose intersection with every line is a single line segment) [63%] 2024-01-24 [Convex analysis] [Convex geometry]...
18. Convex analysis: A branch of mathematics occupying a place intermediate between analysis and geometry, the subject of which are convex functions, convex functionals and convex sets (cf. Convex function (of a real variable); Convex functional; Convex set). (Mathematics) [63%] 2022-11-21
19. Convex subgraph: In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices. Thus, it is analogous to the definition of a convex set in geometry ... [63%] 2023-01-06 [Graph theory]