Related papers: Fast Isotopy Computation for T-Curves
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
Triangle counting is a fundamental graph analytic operation that is used extensively in network science and graph mining. As the size of the graphs that needs to be analyzed continues to grow, there is a requirement in developing scalable…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
In this note we prove a theorem concerning the sewing of even dimensional neighbourly polytopes. The theorem provides a fast algorithm for sewing in practice. We also give a description of the universal faces of a sewn $d$-polytope in terms…
In this paper, we propose a novel method to compute triangle counting on GPUs. Unlike previous formulations of graph matching, our approach is BFS-based by traversing the graph in an all-source-BFS manner and thus can be mapped onto GPUs in…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the…
We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
Calculating dynamical diffraction patterns for X-ray topography and similar x-ray scattering-imaging techniques require the numerical integration of the Takagi-Taupin equations. This is usually performed with a simple second order finite…
We study graph computations in an enhanced data streaming setting, where a space-bounded client reading the edge stream of a massive graph may delegate some of its work to a cloud service. We seek algorithms that allow the client to verify…
For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly…
Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…
Two classical results in algebraic geometry are that the branch curve of a del Pezzo surface of degree 1 can be embedded as a space sextic curve and that every space sextic curve has exactly 120 tritangents corresponding to its odd theta…
We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…
This paper proposes a fast and unsupervised scheme for the polygonal approximation of a closed digital curve. It is demonstrated that the approximation scheme is faster than state-of-the-art approximation and is competitive with Rosin's…
Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain…