On covering bridged plane triangulations with balls

We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003     

Constructions of covering arrays of strength five

A covering array of size N, strength t, degree k and order v, or a CA(N; t, k, v) in short, is an N × k array on v symbols. In every N × t subarray, each t-tuple occurs in at least one row. Covering arrays have been studied for their significant applications to generating software test suites to cover all t-sets of component interactions. In this paper, we present two constructive methods to obtain covering arrays of strength 5 by using difference covering arrays and holey difference matrices with a prescribed property. As a consequence, some new upper bounds on the covering numbers are derived.     

Constructions of new orthogonal arrays and covering arrays of strength three

A covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is a k×N array on v symbols. In every t×N subarray, each t-tuple column vector occurs at least once. When ‘at least’ is replaced by ‘exactly’, this defines an orthogonal array, OA(t,k,v). A difference covering array, or a DCA(k,n;v), over an abelian group G of order v is a k×n array (aij) (1?i?k, 1?j?n) with entries from G, such that, for any two distinct rows l and h of D (1?l<h?k), the difference list Δlh={dh1−dl1,dh2−dl2,…,dhn−dln} contains every element of G at least once.Covering arrays have important applications in statistics and computer science, as well as in drug screening. In this paper, we present two constructive methods to obtain orthogonal arrays and covering arrays of strength 3 by using DCAs. As a consequence, it is proved that there are an OA(3,5,v) for any integer v?4 and v?2 (mod 4), and an OA(3,6,v) for any positive integer v satisfying gcd(v,4)≠2 and gcd(v,18)≠3. It is also proved that the size CAN(3,k,v) of a CA(N;3,k,v) cannot exceed v³+v² when k=5 and v≡2 (mod 4), or k=6, v≡2 (mod 4) and gcd(v,18)≠3.     

Non-hamiltonian triangulations with distant separating triangles

In 1996 Böhme, Harant, and Tká? asked whether there exists a non-hamiltonian triangulation with the property that any two of its separating triangles lie at distance at least 1. Two years later, Böhme and Harant answered this in the affirmative, showing that for any non-negative integer $d$ there exists a non-hamiltonian triangulation with seven separating triangles every two of which lie at distance at least $d$. In this note we prove that the result holds if we replace seven with six, remarking that no non-hamiltonian triangulation with fewer than six separating triangles is known.     

Clean triangulations

A polyhedron on a surface is called a clean triangulation if each face is a triangle and each triangle is a face. LetS _p (resp.N _p ) be the closed orientable (resp. nonorlentable) surface of genusp. If (S) is the smallest possible number of triangles in a clean triangulation ofS, the results are: (N ₁)=20, (S ₁)=24, lim(S _p )p ^–1=4, lim(N _p )p ^–1=2 forp.     

Generating realistic terrains with higher-order Delaunay triangulations

For hydrologic applications, terrain models should have few local minima, and drainage lines should coincide with edges. We show that triangulating a set of points with elevations such that the number of local minima of the resulting terrain is minimized is NP-hard for degenerate point sets. The same result applies when there are no degeneracies for higher-order Delaunay triangulations. Two heuristics are presented to reduce the number of local minima for higher-order Delaunay triangulations, which start out with the Delaunay triangulation. We give efficient algorithms for their implementation, and test on real-world data how well they perform. We also study another desirable drainage characteristic, few valley components, and how to obtain it for higher-order Delaunay triangulations. This gives rise to a third heuristic. Tables and visualizations show how the heuristics perform for the drainage characteristics on real-world data.     

2-isohedral triangulations

A triangulations is 2-isohedral iff there are exactly two orbits of triangles under the triangulation's symmetry group. 2-isohedral triangulations are classified using incidence symbols. This also determines the homeomeric types of 2-isohedral triangulation. There are 38 types. The proof is by aggregation into isohedral tilings and by reflection axis splitting.     

Variable resolution triangulations

A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A general model is introduced, called a Multi-Triangulation (MT), which is based on a collection of fragments of triangulations arranged into a directed acyclic graph. Different decompositions of a domain can be obtained by combining different fragments of the model. Theoretical results on the expressive power of the MT are given. An efficient algorithm is proposed that can extract a triangulation from the MT, whose level of detail is variable over the domain according to a given threshold function. The algorithm works in linear time, and the extracted representation has minimum size among all possible triangulations that can be built from triangles in the MT, and that satisfy the given level of detail. Major applications of these results are in real-time rendering of complex surfaces, such as topographic surfaces in flight simulation.     

Products of foldable triangulations

Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [E. Soprunova, F. Sottile, Lower bounds for real solutions to sparse polynomial systems, Adv. Math. 204 (1) (2006) 116–151]. Special attention is paid to the cube case.     

Acute triangulations of trapezoids

In this paper we discuss acute triangulations of trapezoids. It is known that every rectangle can be triangulated into eight acute triangles, and that this is best possible. In this paper we prove that all other trapezoids can be triangulated into at most seven acute triangles.     

Essential coverings and triangulations

Sunto In questo lavoro si danno condizioni sufficienti per un ricoprimento di una varietà differenziabile V affinchè il suo nerbo abbia lo stesso tipo P.L. di V e si prova l'esistenza di una larga classe di siffatti ricoprimenti.

---

---

The author is member of G.N.S.A.G.A. of the C.N.R. and partially supported by a N.A.T.O.-C.N.R. fellowship.     

Spanning triangulations in graphs

We prove that every graph of sufficiently large order n and minimum degree at least 2n/3 contains a triangulation as a spanning subgraph. This is best possible: for all integers n, there are graphs of order n and minimum degree ?2n/3? ? 1 without a spanning triangulation. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Geometric triangulations and flips

We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.     

Harmonic deformation of Delaunay triangulations

We construct harmonic functions on random graphs given by Delaunay triangulations of ergodic point processes as the limit of the zero-temperature harness process.     

Homeomorphisms of triangulations with applications to computing fixed points

In the past decade various complementary pivoting algorithms have been developed to search for fixed points of certain functions and point to set maps. All these methods generate a sequence of simplexes which are shrinking to a point. This paper proposes a new method for shrinking the simplexes. It is shown that under certain conditions, the function whose fixed point is sought may be used to control this shrinking process. A computational method for implementing these ideas is also suggested and several examples are solved using this approach.An abstract appears in the November, 1978 issue of Notices of the American Mathematical Society.     

Hamiltonian embeddings from triangulations

A Hamiltonian embedding of K_n is an embedding of K_n in a surface,which may be orientable or non-orientable, in such a way thatthe boundary of each face is a Hamiltonian cycle. Ellinghamand Stephens recently established the existence of such embeddingsin non-orientable surfaces for n = 4 and n 6. Here we presentan entirely new construction which produces Hamiltonian embeddingsof K_n from triangulations of K_n when n 0 or 1 (mod 3). We thenuse this construction to obtain exponential lower bounds forthe numbers of nonisomorphic Hamiltonian embeddings of K_n.