Related papers: Simplifying triangulations of S^3

The aim of this paper is to derive explicitly a connection between the Zagier elliptic trilogarithm and Mahler measures of a certain family of three-variable polynomials defining K3 surfaces. In addition, we prove some linear relations…

We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

The classical Seifert algorithm provides an explicit construction of a Seifert surface for any link in $S^3$. Alegria and Menasco extended this construction to integral homology $3$-spheres using Heegaard splittings. In this paper, we…

In this paper we study the operation of cutting off edges of a simple $3$-polytope $P$ along the graph $\Gamma$. We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of…

The main goal of the present research is to make a summary of analytical equations that can be found to calculate a swing-by maneuver in the three-dimensional space. Analytical equations based in the patched conics approximation are showed…

In this paper we show that there are applications that transform the movement of a pendulum into movements in $\mathbb{R}^3$. This can be done using Euler top system of differential equations. On the constant level surfaces, Euler top…

Three parameterizations are developed for modeling translational motion of a point mass in atmosphere flight over a central rotating body. Unlike well-known parameterizations such as spherical coordinate parameterizations, where position…

Let $P$ and $Q$ be polytopes, the first of "low" dimension and the second of "high" dimension. We show how to triangulate the product $P \times Q$ efficiently (i.e., with few simplices) starting with a given triangulation of $Q$. Our method…

In molecular physics, it is often necessary to average over the orientation of molecules when calculating observables, in particular when modelling experiments in the liquid or gas phase. Evaluated in terms of Euler angles, this is closely…

Basing on analogy between the three-body scattering problem and the diffraction problem of the plane wave (for the case of the short range pair potentials) by the system of six half transparent screens, we presented a new approach to the…

It is known that any contact 3-manifold can be obtained by rational contact Dehn surgery along a Legendrian link L in the standard tight contact 3-sphere. We define and study various versions of contact surgery numbers, the minimal number…

We have employed Particle Swarm Optimization to address a stochastic variant of the Smallest Enclosing Sphere estimation problem. An efficient algorithm has been developed to ascertain the optimal center and radius of a sphere encompassing…

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

I define a model of three-dimensional simplicial gravity using an extended ensemble of triangulations where, in addition to the usual combinatorial triangulations, I allow degenerate triangulations, i.e. triangulations with distinct…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

An approach is developed to find approximate solutions to the restricted circular three body problem. The solution is useful in approximately describing the position vectors of three spherically symmetric masses, one of which has a much…

This paper uses mathematics to analyze the challenges of geometrically noisy environments on triangulation. Given widely accepted algorithmic triangulation methods, such as O (n ln n) or a simpler O (n^3) method, we can mathematically prove…

During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…

A parameterization is described for quantifying translational motion of a point in three-dimensional Euclidean space. The parameterization is similar to well-known parameterizations such as spherical coordinates in that both position and…