二次曲线与其任意两条切线所围面积为定常值的问题研究

本文得到了二次曲线的任意两条相交切线与曲线本身围成的面积如果为定常值，则切线交点的轨迹仍为同类型二次曲线．又若给定两条同类的二次曲线，由其中一条上的每一点向另一条引出两条切线，则这两条切线与另一条曲线围成的面积为定常值．     

A characterization of the Euclidean ball in terms of concurrent sections of constant width

We prove that the Euclidean ball is the unique convex body with the property that all its sections through a fixed point are convex bodies of constant width. Furthermore, we characterize those convex bodies which are sections of convex bodies of constant width.Research supported by the Alexander von Humboldt-Foundation.     

Remarks on minimal annuli in a slab

We show that the two closed boundary curves of a minimal annulus in a slab are both convex if one of them is convex and along the other curve the surface meets the plane at a constant angle. And therefore, under the same condition, the minimal annulus is foliated by convex planar curves all of which are parallel to the boundary. In particular, if the convex curve is a circle, then the annulus is part of a catenoid.     

Extremal Polygons with Minimal Perimeter

In this paper we will investigate an isoperimetric type problem in lattices. If K is a bounded O-symmetric (centrally symmetric with respect to the origin) convex body in En of volume v(K) = 2n det L which does not contain non-zero lattice points in its interior, we say that K is extremal with respect to the given lattice L. There are two variations of the isoperimetric problem for this class of polyhedra. The first one is: Which bodies have minimal surface area in the class of extremal bodies for a fixed n-dimensional lattice? And the second one is: Which bodies have minimal surface area in the class of extremal bodies with volume 1 of dimension n? We characterize the solutions of these two problems in the plane. There is a consequence of these results, the solutions of the above problems in the plane give the solution of the lattice-like covering problem: Determine those centrally symmetric convex bodies whose translated copies (with respect to a fixed lattice L) cover the space and have minimal surface area.

     

The singular evolutoids set and the extended evolutoids front

Aequationes mathematicae - In this paper we introduce the notion of the singular evolutoid set which is the set of all singular points of all evolutoids of a fixed smooth planar curve with at most...     

Area-preserving evolution of nonsimple symmetric plane curves

The area-preserving nonlocal flow in the plane is investigated for locally convex closed curves, which may be nonsimple. For highly symmetric convex curves, the flows converge to m-fold circles, while for Abresch–Langer type curves, the convergence to m-fold circles happens if and only if the enclosed algebraic area is positive.     

Antipodal convex hypersurfaces

Motivated by a conjecture of Steinhaus, we consider the mapping F, associating to each point x of a convex hypersurface the set of all points at maximal intrinsic distance from x. We first provide two large classes of hypersurfaces with the mapping F single-valued and involutive. Afterwards we show that a convex body is smooth and has constant width if its double has the above properties of F, and we prove a partial converse to this result. Additional conditions are given, to characterize the (doubly covered) balls.     

Stability of a reverse isoperimetric inequality

In this note we will present a stability property of the reverse isoperimetric inequality newly obtained in [S.L. Pan, H. Zhang, A reverse isoperimetric inequality for convex plane curves, Beiträge Algebra Geom. 48 (2007) 303-308], which states that if K is a convex domain in the plane with perimeter p(K) and area a(K), then one gets , where denotes the oriented area of the domain enclosed by the locus of curvature centers of the boundary curve ∂K, and the equality holds if and only if K is a circular disc.     

平面常宽凸集的Firey-Sallee定理

常宽凸集是一类广泛应用在机械设计、医学等领域的特殊几何图形.本文探讨平面中的常宽凸集,简化证明著名的Firey-Sallee定理,即宽度相等的正Reuleaux多边形中Reuleaux三角形的面积最小.     

A direct proof of a theorem of Blaschke and Lebesgue

The Blaschke-Lebesgue Theorem states that among all planar convex domains of given constant width B the Reuleaux triangle has minimal area. It is the purpose of this article to give a direct proof of this theorem by analyzing the underlying variational problem. The advantages of the proof are that it shows uniqueness (modulo rigid deformations such as rotation and translation) and leads analytically to the shape of the area-minimizing domain. Most previous proofs have relied on foreknowledge of the minimizing domain. Key parts of the analysis extend to the higher-dimensional situation, where the convex body of given constant width and minimal volume is unknown.     

An isoperimetric inequality for convex polygons and convex sets with the same symmetrals

Suppose that two distinct plane convex bodies have the same Steiner symmetrals about a finite number n of given lines. Then we obtain an upper bound for the measure of their symmetric difference. The bound is attained if, and only if, the directions of the lines are equally spaced and the bodies are two regular concentric polygons, with n sides, each obtained from the other by rotation through an angle /n. This result follows from a new isoperimetric inequality for convex polygons.     

Some results on the strength of relaxations of multilinear functions

We study approaches for obtaining convex relaxations of global optimization problems containing multilinear functions. Specifically, we compare the concave and convex envelopes of these functions with the relaxations that are obtained with a standard relaxation approach, due to McCormick. The standard approach reformulates the problem to contain only bilinear terms and then relaxes each term independently. We show that for a multilinear function having a single product term, this approach yields the convex and concave envelopes if the bounds on all variables are symmetric around zero. We then review and extend some results on conditions when the concave envelope of a multilinear function can be written as a sum of concave envelopes of its individual terms. Finally, for bilinear functions we prove that the difference between the concave upper bounding and convex lower bounding functions obtained from the McCormick relaxation approach is always within a constant of the difference between the concave and convex envelopes. These results, along with numerical examples we provide, give insight into how to construct strong relaxations of multilinear functions.     

An Attractor-Repeller approach to floorplanning

The floorplanning (or facility layout) problem consists in finding the optimal positions for a given set of modules of fixed area (but perhaps varying height and width) within a facility such that the distances between pairs of modules that have a positive connection cost are minimized. This is a hard combinatorial optimization problem; even the restricted version where the shapes of the modules are fixed and the optimization is taken over a fixed finite set of possible module locations is NP-hard. In this paper, we extend the concept of target distance introduced by Etawil and Vannelli and apply it to derive the AR (Attractor-Repeller) model which is designed to improve upon the NLT method of van Camp et al. This new model is designed to find a good initial point for the Stage-3 NLT solver and has the advantage that it can be solved very efficiently using a suitable optimization algorithm. Because the AR model is not a convex optimization problem, we also derive a convex version of the model and explore the generalized target distances that arise in this derivation. Computational results demonstrating the potential of our approach are presented.     

The impossibility of convex constant returns-to-scale production technologies with exogenously fixed factors

The extensions to the variable (VRS) and the constant (CRS) returns-to-scale models developed by Banker and Morey are considered among the main approaches to the incorporation of exogenously fixed factors in models of data envelopment analysis (DEA). Recently, Syrjänen showed that the Banker and Morey CRS technology is not convex. Taking into account that its subset VRS technology is explicitly assumed convex, this observation leads to difficulties with explaining the fundamental production assumptions of the CRS extension. Motivated by the example of Syrjänen, the contribution of this paper is twofold. First, we show that the nonconvex Banker and Morey CRS technology is nevertheless a suitable reference technology for the assessment of scale efficiency. Second, we ask if a convex technology could be constructed that would “correct” the nonconvexity of the CRS technology of Banker and Morey. The answer to this is negative: one consequence of assuming both convexity and ray unboundness with fixed exogenous factors is that we can always “mix-and-match” discretionary and nondiscretionary factors taken from different units, arriving at totally unrealistic production plans. This demonstrates that generally there exists no meaningful convex CRS technology with exogenously fixed factors that can be used in its own right, apart from its use as a reference technology in the measurement of scale efficiency.     

Global Existence of Supersonic Flow Past a Curved Convex Wedge

In this paper we discuss the supersonic flow past a curved convex wedge. Our conclusion is that if the vertex angle of the wedge is less than a critical angle, the shock attached the head of the wedge is weak, and if the wedge is formed by a smooth convex curve, monotonically increasing, then the global solution of such a boundary value problem exists.     

The Surface Area Deviation of the Euclidean Ball and a Polytope

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex bodies by arbitrarily positioned polytopes with a fixed number of vertices or facets in the symmetric surface area deviation.     

Typical curvature behaviour of bodies of constant width

It is known that an n-dimensional convex body, which is typical in the sense of Baire category, shows a simple, but highly non-intuitive curvature behaviour: at almost all of its boundary points, in the sense of measure, all curvatures are zero, but there is also a dense and uncountable set of boundary points at which all curvatures are infinite. The purpose of this paper is to find a counterpart to this phenomenon for typical convex bodies of given constant width. Such bodies cannot have zero curvatures. A main result says that for a typical n-dimensional convex body of constant width 1 (without loss of generality), at almost all boundary points, in the sense of measure, all curvatures are equal to 1. (In contrast, note that a ball of width 1 has radius 1/2, hence all its curvatures are equal to 2.) Since the property of constant width is linear with respect to Minkowski addition, the proof requires recourse to a linear curvature notion, which is provided by the tangential radii of curvature.     

Enclosed convex hypersurfaces with maximal affine area

In this paper we study the regularity of closed, convex surfaces which achieve maximal affine area among all the closed, convex surfaces enclosed in a given domain in the Euclidean 3-space. We prove the C^1,α regularity for general domains and C^1,1 regularity if the domain is uniformly convex. This work is supported by the Australian Research Council. Research of Sheng was also supported by ZNSFC No. 102033. On leave from Zhejiang University.     

平面常宽凸域的不对称性度量

通过引入刻画平面常宽凸域的不对称性函数,证明了在平面常宽凸域中,圆域 是最对称的,而Reuleaux三角形是最不对称的．