相关论文: An Analysis of Triangulation in Geometrically Nois…

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…

Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…

We present new computational methods for proving diffeomorphy of triangulated 4-manifolds, including algorithms and topological software that can for the first time effectively handle the complexities that arise in dimension four and be…

The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…

The main purpose of this paper is to present a kneading theory for two-dimensional triangular maps. This is done by defining a tensor product between the polynomials and matrices corresponding to the one-dimensional basis map and fiber map.…

Simulation involves predicting responses of a physical system. In this article, we simulate opto-acoustic signals generated in a three-dimensional volume due to absorption of an optical pulse. A separable computational model is developed…

We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…

We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…

Non-linear parametric resonances occur frequently in nature. Here we summarize how they can be studied by means of perturbative methods. We show in particular how resonances can affect the motion of a test particle orbiting in the vicinity…

Straightedge and compass construction problems are one of the oldest and most challenging problems in elementary mathematics. The central challenge, for a human or for a computer program, in solving construction problems is a huge search…

Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this…

The capacity of automatically modeling photographic composition is valuable for many real-world machine vision applications such as digital photography, image retrieval, image understanding, and image aesthetics assessment. The triangle…

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Image triangulation, the practice of decomposing images into triangles, deliberately employs simplification to create an abstracted representation. While triangulating an image is a relatively simple process, difficulties arise when…

We give a simple formula for the signature of a foldable triangulation of a lattice polygon in terms of its boundary. This yields lower bounds on the number of real roots of certain of systems of polynomial equations known as "Wronski…

Orbits in the principal planes of triaxial potentials are known to be prone to unstable motion normal to those planes, so that three dimensional investigations of those orbits are needed even though they are two dimensional. We present here…

In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin…

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…

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…