In this paper we investigate the convex set in a plane of constant curvature.
本文研究常曲率平面上的凸集，研究常曲平面上的凸集方法。
The concept of -generalized convex set-valued map is defined in linear topological space.
在线性拓扑空间中，定义了-广义锥凸集值映射的概念。
We first give a new definition, the support direction of a boundary point of a convex set.
给出了集合的边界点的支持方向的新概念。
The establishment of a recurrence relation in geometric convex set is the key to solve a problem.
几何凸集中递归关系的建立是求解问题的关键。
By using the generalized support function, we can get the integral for the power of chords of a convex set.
本文研究了凸域内定长线段的包含测度问题，利用广义支持函数和限弦函数，得到了一类特殊凸域的包含测度。
In this paper, firstly the concept of generalized convex set-valued map is defined in ordered linear topological Spaces.
在序线性拓扑空间中定义了广义凸集值映射。
Some relationships among the support function and indicator function of a convex set and their second-order epi-derivatives are given.
利用集合的表示函数、支撑函数、距离函数和投影等研究闭凸体的典范表示及点到边界的投影特征。
In this paper we consider the uncertainty of seismic strength using convex set approach other then the traditional probabilistic method.
采用非传统概率方法—凸集方法来考虑地震动强度的不确定性。
And the expression of its subdifferential is developed in the case that the effective domain of the sup-type function is a non-empty convex set.
在极大值函数的有效域为非空凸集的条件下研究了次微分，并给出它的结构表达式。
Based on the set theoretic formulation, a projection onto convex sets (POCS) algorithm is applied to find the solution to face image reconstruction.
通过迭代求解法和高斯金字塔模型，快速精确地估计得到配准参数，采用凸集投影（POCS）算法对图像序列进行了超分辨率重建。
Then relative interior is introduced and an alternative theorem of generalized convex set-valued maps is established by using the separation theorem.
引进了相对内部，应用凸集分离定理建立了一个广义凸集值映射的择一性定理。
The problem of the existence of a cone subdifferential for the cone convex set valued maps in the locally convex, linear and topological vector space is discussed.
在局部凸线性拓扑向量空间讨论了一种锥凸集值映射的锥次微分的存在性问题，证明了几个锥次微分的存在定理。
Using separation theorem of convex set and the time terminal value function equation, we obtain the determining method of optimal terminal time as well as the Maximum principle.
由凸集分离定理及终端时间阈值函数方程，我们获得了最大值原理及最优控制时间的确定方法。
A group of ellipsoidal invariant sets is designed off-line, and then constitutes a terminal constraint convex set whose coefficients are taken as on-line optimization variables.
通过离线设计一组椭圆不变集，并将其组合成一个终端约束凸集，其中凸集参数作为在线优化变量。
In Chapter 1, the space of families of pair of convex sets is introduced, which is the quotient space of the set of families of convex sets under suitable equivalence relations.
第1章介绍了凸集类对空间理论，及基于凸集类对空间理论介绍了广义拟可微函数的部分微分理论。
It is shown that a point and a (compact) convex set are separated in this paper, and two compact convex sets are separated by a point of the original space in normed dual space.
给出了赋范共轭空间的点与(紧)凸集、紧凸集之间被原空间中的点分隔的定理。
This paper defines a kind of derivative for real function on convex set which is in linear space. By means of the derivative we study convexity of function and obtain some decision theories.
本文对线性空间中的凸集上的实值函数定义一种导数，用其研究函数凸性，得到了上述三种凸函数的若干判定定理。
In chapter 2, we introduce the knowledge that the paper use, introducing these conception of cone, cone convex set-valued maps, tangent cones, and tangent derivatives of set-valued mapping, etc.
第二章是预备知识，介绍了锥、锥凸集值函数、切锥与集值映射的切导数等的相关知识。
Based on geometry and convex set methods, this paper gives systemically the definitions of global and local convexity for planar closed parametric curve, and proves the two definitions are equivalent.
从几何和凸集的角度，系统地给出了平面闭参数曲线全局凸和局部凸定义，并且证明了这两个定义是等价的。
The core is a set which satisfies a system of weak linear inequalities, so it is closed and convex.
中心是一个满足弱线性不等式的合集，因此它是封闭的、凸的。
It is obtained that a necessary and sufficient condition for a closed fuzzy set to be a convex fuzzy set.
引入线性拓扑空间中的凸闭模糊集概念，得到闭模糊集是凸模糊集的充分必要条件。
Related problems and concepts include; convex operator, reciprocity set and reciprocity principles, H-generalized solution and operator-differential equation, etc.
有关的问题与概念有：凸算子，互易集与互易原理，H广义解，算子微分方程等。
The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
Two kinds of common operation on the set of nodes in a plane are calculating its convex hull and triangulation, and usually the algorithms are studied independently.
平面点集作为一种常见数学模型，其上常做的运算是求其凸包和三角网格。
A set of additive uncertainties independent of the actual states is utilized in this paper to include this intersection, whose parameters can be obtained offline through convex optimizations.
本文采用了一个不依赖于系统真实状态的加性不确定性来包含该交集。描述该加性不确定性的参数可以通过离线凸优化得到。
Under several suitable transformations, the problem of positive solutions for set-valued condensing mapping equation in an ordered locally convex topological space is studied by some homotopy method.
本文用某种同伦方法，借助于一些适当的变换，讨论了有序的局部凸拓扑线性空间中集值凝聚映象方程的正解问题。
The cusp balance inclination of tradition anatomic occlusal form artificial teeth is convex, which is a disadvantage factor to set up stable and unhindered chew course.
传统解剖聒型总义齿人工牙凸面的牙尖平衡斜面形态是形成稳定顺畅的咀嚼过程的不利因素。
In this paper a new concept, the strictly efficient solution, is introduced, the Cone-continuous convex map and the connectedness of the set of strictly efficient solution, are studied further.
文中介绍了严有效解的概念，研究了锥—连续拟凸映射的严有效解的连通性。
Specifically, given a set of points in the plane, please construct the convex hull and output an encoded description of all the extreme points.
具体地，对于平面上的任意一组点，请构造出对应的凸包，并在经过编码转换之后输出所有极点的信息。
Specifically, given a set of points in the plane, please construct the convex hull and output an encoded description of all the extreme points.
具体地，对于平面上的任意一组点，请构造出对应的凸包，并在经过编码转换之后输出所有极点的信息。
应用推荐