Related papers: Computing Topological Transition Sets for Line-Lin…
We introduce Topological Offsets, a novel approach to generate manifold and self-intersection-free offset surfaces that are topologically equivalent to an offset infinitesimally close to the surface. Our approach, by construction, creates a…
Gapped fracton phases of matter generalize the concept of topological order and broaden our fundamental understanding of entanglement in quantum many-body systems. However, their analytical or numerical description beyond exactly solvable…
A Voronoi diagram partitions the plane into convex cells, each containing the points closest to a single generator. Given such a tessellation, the inverse Voronoi problem seeks the generator set \( S \) that produced it. Our algorithm…
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…
We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits, realizing any abelian non-chiral topological phase as an actively error-corrected fault-tolerant memory. These circuits are constructed…
We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$…
In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and…
Deep convolutional neural networks achieve remarkable visual recognition performance, at the cost of high computational complexity. In this paper, we have a new design of efficient convolutional layers based on three schemes. The 3D…
We present an edge labeling of order-$k$ Voronoi diagrams, $V_k(S)$, of point sets $S$ in the plane, and study properties of the regions defined by them. Among them, we show that $V_k(S)$ has a small orientable cycle and path double cover,…
In this paper, we explore topological quantum computation augmented by subphases and phase transitions. We commence by investigating the anyon tunneling map, denoted as $\varphi$, between subphases of the quantum double model…
We show bifurcation of localized spike solutions from spatially constant states in systems of nonlocally coupled equations in the whole space. The main assumptions are a generic bifurcation of saddle-node or transcritical type for spatially…
A jammed packing of frictionless spheres at zero temperature is perfectly specified by the network of contact forces from which mechanical properties can be derived. However, we can alternatively consider a packing as a geometric structure,…
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
The Radon transform is a fundamental tool for analyzing data in tomographic imaging, optimal transport, crystallography, and geometric analysis. Numerical computations require an accurate discretization. To deal with voxelized images and…
A number of geometric and topological properties of samples of crack-template based conductive films are examined to assess the degree to which Voronoi diagrams can successfully model structure and conductivity in such networks. Our…
We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…