Related papers: Shelling and Sinking Graphs on the Sphere
A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…
Graph mining applications analyze the structural properties of large graphs, and they do so by finding subgraph isomorphisms, which makes them computationally intensive. Existing graph mining techniques including both custom graph mining…
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…
A thin circular elastic sheet floating on a drop-like liquid substrate is deformed due to incompatibility between the curved substrate and the planar sheet. We adopt a variational viewpoint by minimizing the non-convex membrane energy…
We propose a new model-order reduction framework to poorly reducible problems arising from parametric partial differential equations with geometric variability. In such problems, the solution manifold exhibits a slowly decaying Kolmogorov…
In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…
Edge-preserving smoothing is a fundamental procedure for many computer vision and graphic applications. This can be achieved with either local methods or global methods. In most cases, global methods can yield superior performance over…
Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…
We construct a symplectic, globally defined, minimal-coordinate, equivariant integrator on products of 2-spheres. Examples of corresponding Hamiltonian systems, called spin systems, include the reduced free rigid body, the motion of point…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M…
A new construction of a directional continuous wavelet analysis on the sphere is derived herein. We adopt the harmonic scaling idea for the spherical dilation operator recently proposed by Sanz et al. but extend the analysis to a more…
In this work, we apply two meshless methods for the numerical solution of the time-dependent transport equation defined on the sphere in spherical coordinates. The first technique, which was introduced by Mirzaei (BIT Numerical Mathematics,…
We present a numerically efficient and accurate Multiple Scattering formalism, which is a generalization of the Multiple Scattering method with a truncated basis set [X. -G. Zhang and W. H. Butler, Phys. Rev. B 46,7433 (1992)]. Compared to…
For the accurate representation and reconstruction of band-limited signals on the sphere, an optimal-dimensionality sampling scheme has been recently proposed which requires the optimal number of samples equal to the number of degrees of…
The object recognition is a complex problem in the image processing. Mathematical morphology is Shape oriented operations, that simplify image data, preserving their essential shape characteristics and eliminating irrelevancies. This paper…
For sink-free orientations in graphs of minimum degree at least $3$, we show that there is a deterministic approximate counting algorithm that runs in time $O((n^{73}/\varepsilon^{72})\log(n/\varepsilon))$, a near-linear time sampling…
The paper is devoted to finding the colorings of the edges of the 1-skeleton of triangulations of the 2-sphere in three colors so that for each face all three of its sides have different colors. First, by the method of adding one vertex…
We consider arbitrary-shaped microswimmers of spherical topology and propose a framework for expressing their slip velocity in terms of tangential basis functions defined on the boundary of the swimmer using the Helmholtz decomposition.…