Related papers: On equivalence of vector-valued maps

Since their introduction in the shape analysis community, functional maps have met with considerable success due to their ability to compactly represent dense correspondences between deformable shapes, with applications ranging from shape…

To address the problem of 3D point matching where the poses of two point sets are unknown, we adapt a recently proposed path following based method to use similarity transformation instead of the original affine transformation. The reduced…

Comparing two geometric graphs embedded in space is important in the field of transportation network analysis. Given street maps of the same city collected from different sources, researchers often need to know how and where they differ.…

We show that the notions of homotopy epimorphism and homological epimorphism in the category of differential graded algebras are equivalent. As an application we obtain a characterization of acyclic maps of topological spaces in terms of…

The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial…

Gradient vector fields are fundamental objects from both theoretical and practical perspectives, since various phenomena can be modeled within this framework. The ``moduli space'' of such vector fields provides the foundation for describing…

This paper gives an introduction to the homotopy theory of quasi-categories. Weak equivalences between quasi-categories are characterized as maps which induce equivalences on a naturally defined system of groupoids. These groupoids…

In this work we define the trajectory coset of an affine map and use it to study the similarity classes of affine maps. We use the trajectory coset, a tool which allows us to gain a deeper understanding of the interplay between geometry…

For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

The aim of this paper is to present an extragradient method for variational inequality associated to a point-to-set vector field in Hadamard manifolds and to study its convergence properties. In order to present our method the concept of…

In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…

Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…

We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…

For realcompact spaces X and Y we give a complete description of the linear biseparating maps between spaces of vector-valued continuous functions on X and Y, where special attention is paid to spaces of vector-valued bounded continuous…

We discuss the local and global problems for the equivalence of geometric structures of an arbitrary order and, in later sections, attention is given to what really matters, namely the equivalence with respect to transformations belonging…

Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it is known that in most cases there are no distortion maps. In…

In many applications such as color image processing, data has more than one piece of information associated with each spatial coordinate, and in such cases the classical optimal mass transport (OMT) must be generalized to handle…

A natural mapping of paths in a curved space onto the paths in the corresponding (tangent) flat space may be used to reduce the curved-space-time path integral to the flat-space-time path integral. The dynamics of the particle in a curved…

Graph vertex ordering is widely employed in spatial data analysis, especially in urban analytics, where street graphs serve as spatial discretization for modeling and simulation. It is also crucial for visualization, as many methods require…