Symmetrization of Convex Planar Curves

نویسنده

  • Marcos Craizer
چکیده

Given a closed convex planar curve, we call great chords the segment connecting two points with parallel tangents. We call great diagonals the support lines of the great chords and mid-parallels the lines through the mid-point of a great chord parallel to the corresponding tangents. Two curves are called parallel if the corresponding great diagonals are parallel. In this paper, we define the parallel diagonal (PD) transform of a convex curve γ as a convex curve δ whose great diagonals coincide with the mid-parallels of γ and whose mid-parallels are parallel to the great diagonals of γ. Applying twice the PD transform, we obtain a transformation S that preserves parallelism of the curves. The main result of the paper says that the sequence of iterations S(γ) converges uniformly to a symmetric curve parallel to γ. Mathematics Subject Classification (2010). 53A10.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Space of Minimal Annuli Bounded by an Extremal Pair of Planar Curves

In 1956 Shiffman [14] proved that every minimally immersed annulus in 3 bounded by convex curves in parallel planes is embedded. He proved this theorem by showing that the minimal annulus was foliated by convex curves in parallel planes. We are able to prove a related embeddedness theorem for extremal convex planar curves. Recall that a subset of 3 is extremal if it is contained on the boundary...

متن کامل

Stability of the Steiner symmetrization of convex sets

The isoperimetric inequality for Steiner symmetrization of any codimension is investigated and the equality cases are characterized. Moreover, a quantitative version of this inequality is proven for convex sets.

متن کامل

Symmetrization procedures and convexity in centrally symmetric polytopes

Univariate symmetrization technique has many good properties. In this paper, we adopt the high-dimensional viewpoint, and propose a new symmetrization procedure in arbitrary (convex) polytopes of R with central symmetry. Moreover, the obtained results are used to extend to the arbitrary centrally symmetric polytopes the well-known Hermite-Hadamard inequality for convex functions.

متن کامل

Symmetrization, convexity and applications

Based on permutation enumeration of the symmetric group and ‘generalized’ barycentric coordinates on arbitrary convex polytope, we develop a technique to obtain symmetrization procedures for functions that provide a unified framework to derive new Hermite-Hadamard type inequalities. We also present applications of our results to the Wright-convex functions with special emphasis on their key rol...

متن کامل

Motion by Curvature of Planar Networks II

We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth as long as the lengths of the three curves stay far from zero. If this is the case for all times, then the evolution exists for all times and the network converges to the Steiner minimal connecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013