相关论文: On the injectivity of mean value mappings between …

We prove that Mean Value mapping between convex quadrilaterals is injective, affirmatively proving a conjecture stated in M. S. Floater and J. Kosinka, On the injectivity of Wachspress and mean value mappings between convex polygons, Adv.…

Mean value interpolation is a method for fitting a smooth function to piecewise-linear data prescribed on the boundary of a polygon of arbitrary shape, and has applications in computer graphics and curve and surface modelling. The method…

In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, doi:10.1007/s10444-011-9218-z], we prove interpolation error estimates for the mean value coordinates on convex polygons…

Quadrilateral layouts on surfaces are valuable in texture mapping, and essential in generation of quadrilateral meshes and in fitting splines. Previous work has characterized such layouts as a special metric on a surface or as a meromorphic…

In the finite dimensional case, mean-type mappings, their invariant means, relations between the uniqueness of invariant means and convergence of orbits of the mapping, are considered. In particular it is shown, that the uniqueness of an…

The geometric mean of two matrices is considered and analyzed from a computational viewpoint. Some useful theoretical properties are derived and an analysis of the conditioning is performed. Several numerical algorithms based on different…

This paper introduces three sets of sufficient conditions, for generating bijective simplicial mappings of manifold meshes. A necessary condition for a simplicial mapping of a mesh to be injective is that it either maintains the orientation…

We give sufficient conditions for a planar quasiregular mapping to be injective in terms of the range of the differential matrix.

In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…

In this work, it is shown that if $A$ is an $n$-by-$n$ convexoid matrix (i.e., its field of values coincides with the convex hull of its eigenvalues), then the field of any $(n-1)$-by-$(n-1)$ principal submatrix of $A$ is inscribed in the…

We prove for the first time a pointwise lower estimate of the normal injectivity radius of an embedded hypersurface in an arbitrary Riemannian manifold. Main applications include: (i) a pointwise lower estimate of the graphing radius of a…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are…

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

Any generalized distance-squared mapping of equidimensional case has singularities, and their singularity types are wrapped into mystery in higher dimensional cases. Any generalized distance-squared mapping of equidimensional case is not…

In order to investigate minimal sufficient conditions for an abstract integral to belong to the convex hull of the integrand, we propose a system of axioms under which it happens. If the integrand is a continuous $R^n$-valued function over…

A convex quadrilateral, $Q$, is called a midpoint diagonal quadrilateral if the intersection point of the diagonals of $Q$ coincides with the midpoint of at least one of the diagonals of $Q$. A parallelogram, P, is a special case of a…

Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the…

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

A convex quadrilateral, $Q$, is called a midpoint diagonal quadrilateral if the intersection point of the diagonals of $Q$ coincides with the midpoint of at least one of the diagonals of $Q$. A parallelogram, P, is a special case of a…

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…