Related papers: Computing minimum area homologies
The minimal area for surfaces whose border are rectangular and circular loops are calculated using the Hamilton-Jacobi (HJ) equation. This amounts to solve the HJ equation for the value of the minimal area, without calculating the shape of…
An approximate homotopy symmetry method for nonlinear problems is proposed and applied to the six-order boussinesq equation. We summarize the general formulas for similarity reduction solutions and similarity reduction equations of…
This paper provides a new similarity detection algorithm. Given an input set of multi-dimensional data points, where each data point is assumed to be multi-dimensional, and an additional reference data point for similarity finding, the…
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…
In the context of functional data analysis, we propose new two sample tests for homogeneity. Based on some well-known depth measures, we construct four different statistics in order to measure distance between the two samples. A simulation…
We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path…
A significant problem with most functional data analyses is that of misaligned curves. Without adjustment, even an analysis as simple as estimation of the mean will fail. One common method to synchronize a set of curves involves equating…
In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the…
Persistent homology is a popular computational tool for analyzing the topology of point clouds, such as the presence of loops or voids. However, many real-world datasets with low intrinsic dimensionality reside in an ambient space of much…
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in…
In this paper, we develop a method to compute the Morse homology of a manifold when descending manifolds and ascending manifolds intersect cleanly, but not necessarily transversely. While obstruction bundle gluing defined by Hutchings and…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If…
We describe a $O(\log n )$-approximation algorithm for computing the homotopic \Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological disk. Prior to this work, algorithms were known only for…
In many applications involving multi-media data, the definition of similarity between items is integral to several key tasks, e.g., nearest-neighbor retrieval, classification, and recommendation. Data in such regimes typically exhibits…
We define a formal framework for equivalence checking of sequential quantum circuits. The model we adopt is a quantum state machine, which is a natural quantum generalisation of Mealy machines. A major difficulty in checking quantum…
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and…