Single-Strip Triangulation of Manifolds with Arbitrary Topology

Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few long strips. In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model. Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary. New vertices are introduced at midpoints of edges and the new triangles thus formed are coplanar with their parent triangles, hence the visual fidelity of the geometry is not changed. We prove that the increase in the number of triangles due to this splitting is 50% in the worst case, however for all models we tested the increase was less than 2%. We also prove tight bounds on the number of triangles needed for a single-strip representation of a model with holes on its boundary. Our strips can be used not only for efficient rendering, but also for other applications including the generation of space filling curves on a manifold of any arbitrary topology.Comment: 12 pages, 10 figures. To appear at Eurographics 200

A generalisation of the deformation variety

Given an ideal triangulation of a connected 3-manifold with non-empty boundary consisting of a disjoint union of tori, a point of the deformation variety is an assignment of complex numbers to the dihedral angles of the tetrahedra subject to Thurston's gluing equations. From this, one can recover a representation of the fundamental group of the manifold into the isometries of 3-dimensional hyperbolic space. However, the deformation variety depends crucially on the triangulation: there may be entire components of the representation variety which can be obtained from the deformation variety with one triangulation but not another. We introduce a generalisation of the deformation variety, which again consists of assignments of complex variables to certain dihedral angles subject to polynomial equations, but together with some extra combinatorial data concerning degenerate tetrahedra. This "extended deformation variety" deals with many situations that the deformation variety cannot. In particular we show that for any ideal triangulation of a small orientable 3-manifold with a single torus boundary component, we can recover all of the irreducible non-dihedral representations from the associated extended deformation variety. More generally, we give an algorithm to produce a triangulation of a given orientable 3-manifold with torus boundary components for which the same result holds. As an application, we show that this extended deformation variety detects all factors of the PSL(2,C) A-polynomial associated to the components consisting of the representations it recovers.Comment: 47 pages, 26 figures. Rewrote introduction and added motivation section based on referee's comments. Rewrote the section on retriangulation, and added new result on small manifolds with a single cus

On spun-normal and twisted squares surfaces

Given a 3 manifold M with torus boundary and an ideal triangulation, Yoshida and Tillmann give different methods to construct surfaces embedded in M from ideal points of the deformation variety. Yoshida builds a surface from twisted squares whereas Tillmann produces a spun-normal surface. We investigate the relation between the generated surfaces and extend a result of Tillmann's (that if the ideal point of the deformation variety corresponds to an ideal point of the character variety then the generated spun-normal surface is detected by the character variety) to the generated twisted squares surfaces.Comment: 14 pages, 10 figure

Buckling instability in type-II superconductors with strong pinning

We predict a novel buckling instability in the critical state of thin type-II superconductors with strong pinning. This elastic instability appears in high perpendicular magnetic fields and may cause an almost periodic series of flux jumps visible in the magnetization curve. As an illustration we apply the obtained criteria to a long rectangular strip.Comment: Submitted to Phys. Rev. Let

Lower bounds on volumes of hyperbolic Haken 3-manifolds

In this paper, we find lower bounds for volumes of hyperbolic 3-manifolds with various topological conditions. Let V_3 = 1.01494 denote the volume of a regular ideal simplex in hyperbolic 3-space. As a special case of the main theorem, if a hyperbolic manifold M contains an acylindrical surface S, then Vol(M)>= -2 V_3 chi(S). We also show that if beta_1(M)>= 2, then Vol(M)>= 4/5 V_3.Comment: 20 pages, 15 figure

Polynomial kernelization for removing induced claws and diamonds

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique. In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edges from $G$ to obtain a (claw,diamond)-free graph. Our main result is that this problem admits a polynomial kernel. We complement this finding by proving that, even on instances with maximum degree $6$, the problem is NP-complete and cannot be solved in time $2^{o(k)}\cdot |V(G)|^{O(1)}$ unless the Exponential Time Hypothesis fai