Barycentric coordinates for convex sets

In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous applications in various fields as they allow smooth interpolation of data located on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to extend this interpolation in higher dimensions. Moreover, there has been no attempt to extend these functions into the continuous domain, where barycentric coordinates are related to Green’s functions and construct functions that satisfy a boundary value problem. First, we review the properties and construction of barycentric coordinates in the discrete domain for convex polytopes. Next, we show how these concepts extend into the continuous domain to yield barycentric coordinates for continuous functions. We then provide a proof that our functions satisfy all the desirable properties of barycentric coordinates in arbitrary dimensions. Finally, we provide an example of constructing such barycentric functions over regions bounded by parametric curves and show how they can be used to perform freeform deformations.      

算子Dα及其刻划的亚纯p叶函数类

用算子Dα刻划了亚纯星象函数,亚纯凸象函数,亚纯近于凸函数和亚纯拟凸函数的新子类,建立了包含关系,讨论了这些类中函数积分算子的性质.     

Toric Rigid Spaces

This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Univalence and starlikeness of certain transforms defined by convolution of analytic functions

Let U(λ) denote the class of all analytic functions f in the unit disk Δ of the form f(z)=z+a₂z²+? satisfying the condition

     

Approximation of common fixed points for finite families of nonself asymptotically nonexpansive mappings in Banach spaces

Let E be a real uniformly convex Banach space, K be a closed convex nonempty subset of E which is also a nonexpansive retract with retraction P. Let be asymptotically nonexpansive mappings of K into E with sequences (respectively) satisfying kin→1 as n→∞, i=1,2,…,m, and . Let be a sequence in [?,1−?],?∈(0,1), for each i∈{1,2,…,m} (respectively). Let {xn} be a sequence generated for m?2 by

     

高维空间中的有界凸域

证明n维空间中的有界凸域D能被拟共形映射到n维单位球B~n(0,1),即D是拟球,从而说明拟共形映射中的黎曼定理在n维空间中的有界凸域类中是成立的．     

Fixed-Point Iterations for Asymptotically Nonexpansive Mappings in Banach Spaces

In this paper, we suggest and analyze a three-step iterative scheme for asymptotically nonexpansive mappings in Banach spaces. The new iterative scheme includes Ishikawa-type and Mann-type interations as special cases. The results obtained in this paper represent an extension as well as refinement of previous known results.     

A game locating a needle in a circular haystack

A complete solution of the following Hider-Seeker zero-sum game is obtained. The hider hides a needle of lengtha, 0<a2, in the closed unit dise, and the seeker tries to locate it by shooting in a straight line across the disc. The payoff to the seeker is 1 if he hits the needle and 0 otherwise.     

Statistical issues in measurement

Measurement theories are traditionally couched in algebraic terms, which makes them unsuitable for statistical testing. A probabilistic recasting of these theories is proposed here. It is observed then that an axiom of probabilistic measurement has typically the form of a logical polynomial, the structure of which induces a particular partition of the parameter space, giving rise to a calss of statistical problems for which the null hypothesis is a union of convex polyhedrons. This is a consequence of the fact that a logical polynomial can always be rewritten in normal form, that is, as a disjunction of conjunctions. A likelihood ratio method is worked out in a couple of exemplary cases. One of these examples provides a test of transitivity, a property which lies at the heart of ordinal measurement.