Related papers: Shelling and Sinking Graphs on the Sphere
We derive optimal filters on the sphere in the context of detecting compact objects embedded in a stochastic background process. The matched filter and the scale adaptive filter are derived on the sphere in the most general setting,…
We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…
We describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an idea of M. Gromov and A. Nabutovski. The immediate application,…
We propose a transform for signals defined on the sphere that reveals their localized directional content in the spatio-spectral domain when used in conjunction with an asymmetric window function. We call this transform the directional…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
In recent years, mobile robots are becoming ambitious and deployed in large-scale scenarios. Serving as a high-level understanding of environments, a sparse skeleton graph is beneficial for more efficient global planning. Currently,…
We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for…
Kinematics of mechanisms is intricately coupled to their geometry and their utility often arises out of the ability to perform reproducible motion with fewer actuating degrees of freedom. In this article, we explore the assembly of…
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2^(O(k)) + k2 * nm) on graphs with n vertices and m…
It is well known that the SU(2)-gauge invariant phase space of loop gravity can be represented in terms of twisted geometries. These are piecewise-linear-flat geometries obtained by gluing together polyhedra, but the resulting geometries…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
A thin shell finite element approach based on Loop's subdivision surfaces is proposed, capable of dealing with large deformations and anisotropic growth. To this end, the Kirchhoff-Love theory of thin shells is derived and extended to allow…
The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and…
We construct a directional spin wavelet framework on the sphere by generalising the scalar scale-discretised wavelet transform to signals of arbitrary spin. The resulting framework is the only wavelet framework defined natively on the…
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
In this work we introduce a new method for the construction of minimal submanifolds of codimension two in even dimensional spheres and hyperbolic spaces. This is based on the theory of complex-valued harmonic morphisms. This gives the first…
We investigate the linear properties of the steady and axisymmetric stress-driven spin-down flow of a viscous fluid inside a spherical shell, both within the incompressible and anelastic approximations, and in the asymptotic limit of small…
Sphere fitting is a common problem in almost all science and engineering disciplines. Most of methods available are iterative in behavior. This involves fitting of the parameters in a least square sense or in a geometric sense. Here we…