相关论文: Simplifying triangulations of S^3

This paper presents a novel simplification method for removing vertices from an intrinsic triangulation corresponding to extrinsic vertices lying on near-developable (i.e., with limited Gaussian curvature) and general surfaces. We greedily…

We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…

The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

Spherical symmetry is ubiquitous in nature. It's therefore unfortunate that spherical system simulations are so hard, and require complete spheres with millions of interacting particles. Here we introduce an approach to model spherical…

We introduce a visual motion segmentation method employing spherical geometry for fisheye cameras and automoated driving. Three commonly used geometric constraints in pin-hole imagery (the positive height, positive depth and epipolar…

We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

We present a novel algorithm to compute multi-scale curvature fields on triangle meshes. Our algorithm is based on finding robust mean curvatures using the ball neighborhood, where the radius of a ball corresponds to the scale of the…

We exhibit an algorithm to determine the bridge number of a hyperbolic knot in the 3-sphere. The proof uses adaptations of almost normal surface theory for compact surfaces with boundary in ideally triangulated knot exteriors.

In this paper, it is proposed to solve the problem of triangulation for calibrated omnidirectional cameras through the optimisation of ray-pairs on the projective sphere. The proposed solution boils down to finding the roots of a quadratic…

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

W. Thurston proved that to a triangulation of the sphere of non-negative combinatorial curvature, one can associate an element in a certain lattice over the Eisenstein integers such that its orbit is a complete invariant of the…

A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…

We describe a smooth structure, called Fr\"olicher space, on CW complexes and spaces of triangulations. This structure enables differential methods for e.g. minimization of functionnals. As an application, we exhibit how an optimized…

It is known that an ideal triangulation of a compact $3$-manifold with nonempty boundary is minimal if and only if it contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, any ideal one-edge…

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…