‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

The classical Brunn-Minkowski theory for convex bodies was developed from a few basic concepts: support functions, Minkowski combinations, and mixed volumes. As a special case of mixed volumes, the Quermassintegrals are important geometrical quantities of a convex body, and surface area measures are local versions of Quermassintegrals. The Christoffel-Minkowski problem concerns with the existen...

the notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $cat(0)$ space, where the curvature is bounded from above by zero. in fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. in this paper, w...

In this manuscript, we introduce concepts of (m1,m2)-logarithmically convex (AG-convex) functions and establish some Hermite-Hadamard type inequalities of these classes of functions.

Shading is known to produce vivid perceptions of depth. However, the influence of specular highlights on perceived shape is unclear: some studies have shown that highlights improve quantitative shape perception while others have shown no effect. Here we ask how specular highlights combine with Lambertian shading cues to determine perceived surface curvature, and to what degree this is based upo...

In this paper we prove a maximum principle at infinity for properly embedded surfaces with constant mean curvature H > 0 in the 3-dimensional Euclidean space. We show that no one of these surfaces can lie in the mean convex side of another properly embedded H surface. We also prove that, under natural assumptions, if the surface lies in the slab |x3| < 1/2H and is symmetric with respect to the ...

We propose a convex formulation of the correspondence problem between two images with respect to an energy function measuring data consistency and spatial regularity. To this end, we formulate the general correspondence problem as the search for a minimal twodimensional surface in R. We then use tools from geometric measure theory and introduce 2-vector fields as a representation of two-dimensi...

We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let d{subscript p}(p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2*d{subscript p}(p,q) in time O(n). Ex...

We discuss self-crossing patterns of closed geodesics on a convex surface.