Related papers: Recursive simplex stars
We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…
We define novel fully combinatorial models of higher categories. Our definitions are based on a connection of higher categories to "directed spaces". Directed spaces are locally modelled on manifold diagrams, which are stratifications of…
The main purpose of this paper is twofold. We first want to analyze in details the meaningful geometric aspect of the method introduced in the previous paper [12], concerning regularity of families of irreducible, nodal "curves" on a…
It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a stellar ball a*S. The study of S/~, two dimensional stellar sphere S with 2-simplexes identified in pairs…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
We define a geometrically meaningful compactification of the moduli space of smooth plane curves, which can be calculated explicitly. The basic idea is to regard a plane curve D in P^2 as a pair (P^2,D) of a surface together with a divisor,…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
A rule for constructing interpolation nodes for $n$th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto-Gauss-Legendre (LGL) nodes. The resulting…
Accurate distances to stars and galaxies allow for significant tests of stellar evolution, galaxy formation and evolution and cosmology. NASA's Space Interferometry Mission (SIM) will obtain precision [1-30 microarcsec] astrometry for…
We propose a new method to accurately approximate the Pompeiu-Hausdorff distance from a triangle soup A to another triangle soup B up to a given tolerance. Based on lower and upper bound computations, we discard triangles from A that do not…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension $n$, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are…
We define barycentric coordinates on a Riemannian manifold using Karcher's center of mass technique applied to point masses for n+1 sufficiently close points, determining an n-dimensional Riemannian simplex defined as a "Karcher simplex."…
We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work…
Reference metrics are used to define the differential structure on multicube representations of manifolds, i.e., they provide a simple and practical way to define what it means globally for tensor fields and their derivatives to be…
Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…
This paper studies the statistical query (SQ) complexity of estimating $d$-dimensional submanifolds in $\mathbb{R}^n$. We propose a purely geometric algorithm called Manifold Propagation, that reduces the problem to three natural geometric…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
We present a novel and effective method for detecting 3D primitives in cluttered, unorganized point clouds, without axillary segmentation or type specification. We consider the quadric surfaces for encapsulating the basic building blocks of…
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…