Related papers: Simplifying triangulations of S^3
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…
We present a suite of techniques for jointly optimizing triangle meshes and shading models to match the appearance of reference scenes. This capability has a number of uses, including appearance-preserving simplification of extremely…
Any four mutually tangent spheres in R^3 determine three coincident lines through opposite pairs of tangencies. As a consequence, we define two new triangle centers.
In this work we propose a simple but effective high order polynomial correction allowing to enhance the consistency of all kind of boundary conditions for the Euler equations (Dirichlet, characteristic far-field and slip-wall), both in 2D…
It is shown that analytic conformal submersions of $S^3$ are given by intersections of (not necessary closed) complex surfaces with a quadratic real hyper-surface in $\mathbb{C}P^3.$ A new description of the space of circles in the 3-sphere…
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…
In the given paper the algorithm describing original and universal principles of a triangulation of a smooth molecular surface: solvent excluding solvent (SES), received by primary and secondary rolling, and solvent accessible surface (SAS)…
We present here a simple construction of a wavelet system for the three-dimensional ball, which we label \emph{Radial 3D Needlets}. The construction envisages a data collection environment where an observer located at the centre of the ball…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing…
Let $\Omega$ be a bounded domain of $\mathbb{R}^3$ whose closure $\overline{\Omega}$ is polyhedral, and let $\mathcal{T}$ be a triangulation of $\overline{\Omega}$. Assuming that the boundary of $\Omega$ is sufficiently regular, we provide…
Suppose that the initial triangle formed by the three moving masses of the three-body problem is similar to the triangle formed at some later time. We derive a simple integral formula for the overall rotation relating the two triangles. The…
It is known that the $3$-sphere has at most $2^{O(n^2 \log n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{\Omega(n^2)}$ such triangulations.
Normal and almost normal surfaces are essential tools for algorithmic 3-manifold topology, but to use them requires exponentially slow enumeration algorithms in a high-dimensional vector space. The quadrilateral coordinates of Tollefson…
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…
The stabilisation height of a fibre surface in the 3-sphere is the minimal number of Hopf plumbing operations needed to attain a stable fibre surface from the initial surface. We show that families of fibre surfaces related by iterated…