自反Banach空间中锥线性优化问题初始——对偶目标函数水平集的几何性质

讨论自反Banach空间中的原——对偶锥线性优化问题的目标函数水平集的几何性质．在自反Banach空间中,证明了原目标函数水平集的最大模与对偶目标函数水平集的最大内切球半径几乎是成反比例的．     

Planar sections of three-dimensional cylinders

Is it true that every interior point of a three-dimensional convex body lies on its planar section with an inscribed regular hexagon and the center of a centrally symmetric convex body lies on a planar section with an inscribed regular octagon? In this paper, we prove these propositions for cylinders of a special type.     

Discrete extrinsic curvatures and approximation of surfaces by polar polyhedra

Duality principle for approximation of geometrical objects (also known as Eu-doxus exhaustion method) was extended and perfected by Archimedes in his famous tractate “Measurement of circle”. The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygons (polyhedra) which approximate curvilinear convex body. This sequence allows to approximate length of curve, as well as area and volume of the bodies and to obtain error estimates for approximation. In this work it is shown that a sequence of pairs of locally polar polyhedra allows to construct piecewise-affine approximation to spherical Gauss map, to construct convergent point-wise approximations to mean and Gauss curvature, as well as to obtain natural discretizations of bending energies. The Suggested approach can be applied to nonconvex surfaces and in the case of multiple dimensions.     

非欧椭圆几何的若干度量问题

本文用新方法讨论解决了n维椭圆空间Sⁿ中若干几何问题。给出了关于n维球面单形的余弦定理、高的公式、内切及外接球半径r,R以及内心I与外心Q间的距离公式。同时将著名的欧拉不等式推广到Sⁿ中。     

Inscribed Balls and Their Centers

A ball of maximal radius inscribed in a convex closed bounded set with a nonempty interior is considered in the class of uniformly convex Banach spaces. It is shown that, under certain conditions, the centers of inscribed balls form a uniformly continuous (as a set function) set-valued mapping in the Hausdorff metric. In a finite-dimensional space of dimension n, the set of centers of balls inscribed in polyhedra with a fixed collection of normals satisfies the Lipschitz condition with respect to sets in the Hausdorff metric. A Lipschitz continuous single-valued selector of the set of centers of balls inscribed in such polyhedra can be found by solving n + 1 linear programming problems.     

On the stability of inner and outer approximations of a convex compact set by a ball

The finite-dimensional problems of outer and inner estimation of a convex compact set by a ball of some norm (circumscribed and inscribed ball problems) are considered. The stability of the solution with respect to the error in the specification of the estimated compact set is generally characterized. A new solution criterion for the outer estimation problem is obtained that relates the latter to the inner estimation problem for the lower Lebesgue set of the distance function to the most distant point of the estimated compact set. A quantitative estimate for the stability of the center of an inscribed ball is given under the additional assumption that the compact set is strongly convex. Assuming that the used norm is strongly quasi-convex, a quantitative stability estimate is obtained for the center of a circumscribed ball.     

The perimeter of rounded convex planar sets

A convex set is inscribed into a rectangle with sides a and 1/a so that the convex set has points on all four sides of the rectangle. By “rounding” we mean the composition of two orthogonal linear transformations parallel to the edges of the rectangle, which makes a unit square out of the rectangle. The transformation is also applied to the convex set, which now has the same area, and is inscribed into a square. One would expect this transformation to decrease the perimeter of the convex set as well. Interestingly, this is not always the case. For each a we determine the largest and smallest possible increase of the perimeter.      

Use of geometry in finite element thermal radiation combined with ray tracing

In heat transfer for space applications, the exchanges of energy by radiation play a significant role. In this paper, we present a method which combines the geometrical definition of the model with a finite element mesh. The geometrical representation is advantageous for the radiative component of the thermal problem while the finite element mesh is more adapted to the conductive part. Our method naturally combines these two representations of the model. The geometrical primitives are decomposed into cells. The finite element mesh is then projected onto these cells. This results in a ray tracing acceleration technique. Moreover, the ray tracing can be performed on the exact geometry, which is necessary if specular reflectors are present in the model. We explain how the geometrical method can be used with a finite element formulation in order to solve thermal situation including conduction and radiation. We illustrate the method with the model of a satellite.     

关于一个单形及其子单形的内切球半径的一些几何不等式(英文)

In this paper, we obtain some geometric inequalities on the radii of inscribed sphere of a simplex and its subsimplex, as particular case of this paper, we obtain some main results of [1].     

Areas of polygons inscribed in a circle

Heron of Alexandria showed that the areaK of a triangle with sidesa,b, andc is given by $$K = \sqrt {s(s - a)(s - b)(s - c)} ,$$ wheres is the semiperimeter (a+b+c)/2. Brahmagupta gave a generalization to quadrilaterals inscribed in a circle. In this paper we derive formulas giving the areas of a pentagon or hexagon inscribed in a circle in terms of their side lengths. While the pentagon and hexagon formulas are complicated, we show that each can be written in a surprisingly compact form related to the formula for the discriminant of a cubic polynomial in one variable.     

Variational aspects of Poncelet's theorem

We prove results about the maximum or minimum of the length of a convex polygon inscribed in an ellipse or circumscribed around it, respectively. Combining these, we obtain a new proof of Poncelet's theorem on homofocal ellipses and convex polygons.     

Approximation of the Normal Vector Field and the Area of a Smooth Surface

This paper deals with the comparison of the normal vector field of a smooth surface S with the normal vector field of another surface differentiable almost everywhere. The main result gives an upper bound on angles between the normals of S and the normals of a triangulation T close to S. This upper bound is expressed in terms of the geometry of T, the curvature of S and the Hausdorff distance between both surfaces. This kind of result is really useful: in particular, results of the approximation of the normal vector field of a smooth surface S can induce results of the approximation of the area; indeed, in a very general case (T is only supposed to be locally the graph of a lipschitz function), if we know the angle between the normals of both surfaces, then we can explicitly express the area of S in terms of geometrical invariants of T, the curvature of S and of the Hausdorff distance between both surfaces. We also apply our results in surface reconstruction: we obtain convergence results when T is the restricted Delaunay triangulation of an -sample of S; using Chews algorithm, we also build sequences of triangulations inscribed in S whose curvature measures tend to the curvatures measures of S.     

Enumeration of polyominoes inscribed in a rectangle

We develop a number of formulas and generating functions for the enumeration of general polyominoes inscribed in a rectangle of given size according to their area. These formulae are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one.     

On the areas of cyclic and semicyclic polygons

We investigate the “generalized Heron polynomial” that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain variety derived from the variety of binary (2m−1)-forms having m−1 double roots. Thus we obtain explicit formulas for the areas of cyclic heptagons and octagons, and illuminate some mysterious features of Robbins' formulas for the areas of cyclic pentagons and hexagons. We also introduce a companion family of polynomials that relate the squared area of an n-gon inscribed in a circle, one of whose sides is a diameter, to the squared lengths of the other sides. By similar algebraic techniques we obtain explicit formulas for these polynomials for all n7.     

Geometrical characterization of weakly efficient points

In this note, we present a geometrical characterization of the set of weakly efficient points in constrained convex multiobjective optimization problems, valid for a compact set of objectives.     

搓制钻头的数学模型

本文分析搓制钻头工艺,建立了数学模型,并对其进行了几何仿真,得到四板搓的截形数据,给出用一种规格的工具搓制多种规格钻头且符合国标的工具序列数据     

Geometrical optical illusion via sub-Riemannian geodesics in the roto-translation group

We present a neuro-mathematical model for geometrical optical illusions (GOIs), a class of illusory phenomena that consists in a mismatch of geometrical properties of the visual stimulus and its associated percept. They take place in the visual areas V1/V2 whose functional architecture have been modeled in previous works by Citti and Sarti as a Lie group equipped with a sub-Riemannian (SR) metric. Here we extend their model proposing that the metric responsible for the cortical connectivity is modulated by the modeled neuro-physiological response of simple cells to the visual stimulus, hence providing a more biologically plausible model that takes into account a presence of visual stimulus. Illusory contours in our model are described as geodesics in the new metric. The model is confirmed by numerical simulations, where we compute the geodesics via SR-Fast Marching.     

刘徽不等式与祖冲之不等式的注记

利用微分学方法给出刘徽不等式与祖冲之不等式的证明;得到两个关于双曲函数的不等式;还得到两个关于单位圆内接正n边形周长与π之间关系的不等式.     

n-Cubes inscribed in simplices

H. Bailey and D. DeTemple [1] considered some properties of squares inscribed in triangles. In this article we generalise their results to the n-dimensional space.     

Inscribed ball and enclosing box methods for the convex maximization problem

Many important classes of decision models give rise to the problem of finding a global maximum of a convex function over a convex set. This problem is known also as concave minimization, concave programming or convex maximization. Such problems can have many local maxima, therefore finding the global maximum is a computationally difficult problem, since standard nonlinear programming procedures fail. In this article, we provide a very simple and practical approach to find the global solution of quadratic convex maximization problems over a polytope. A convex function achieves its global maximum at extreme points of the feasible domain. Since an inscribed ball does not contain any extreme points of the domain, we use the largest inscribed ball for an inner approximation while a minimal enclosing box is exploited for an outer approximation of the domain. The approach is based on the use of these approximations along with the standard local search algorithm and cutting plane techniques.