Polyhedra with few 3-cuts are hamiltonian

In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will generalize this result and prove that polyhedra with at most three 3-cuts are hamiltonian. In 2002 Jackson and Yu have shown this result for the subclass of triangulations. We also prove that polyhedra with at most four 3-cuts have a hamiltonian path. It is well known that for each $k \ge 6$ non-hamiltonian polyhedra with $k$ 3-cuts exist. We give computational results on lower bounds on the order of a possible non-hamiltonian polyhedron for the remaining open cases of polyhedra with four or five 3-cuts.Comment: 21 pages; changed titl

Linear Complexity Hexahedral Mesh Generation

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an additional bipartiteness condition. The same techniques can also be used to reduce the geometric version of the hexahedral mesh generation problem to a finite case analysis amenable to machine solution.Comment: 12 pages, 17 figures. A preliminary version of this paper appeared at the 12th ACM Symp. on Computational Geometry. This is the final version, and will appear in a special issue of Computational Geometry: Theory and Applications for papers from SCG '9

Amoebas of algebraic varieties and tropical geometry

This survey consists of two parts. Part 1 is devoted to amoebas. These are images of algebraic subvarieties in the complex torus under the logarithmic moment map. The amoebas have essentially piecewise-linear shape if viewed at large. Furthermore, they degenerate to certain piecewise-linear objects called tropical varieties whose behavior is governed by algebraic geometry over the so-called tropical semifield. Geometric aspects of tropical algebraic geometry are the content of Part 2. We pay special attention to tropical curves. Both parts also include relevant applications of the theories. Part 1 of this survey is a revised and updated version of an earlier prepreint of 2001.Comment: 40 pages, 15 figures, a survey for the volume "Different faces in Geometry

Star Unfolding Convex Polyhedra via Quasigeodesic Loops

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q.Comment: 10 pages, 7 figures. v2 improves the description of cut locus, and adds references. v3 improves two figures and their captions. New version v4 offers a completely different proof of non-overlap in the quasigeodesic loop case, and contains several other substantive improvements. This version is 23 pages long, with 15 figure

Geodesics and compression bodies

We consider hyperbolic structures on the compression body C with genus 2 positive boundary and genus 1 negative boundary. Note that C deformation retracts to the union of the torus boundary and a single arc with its endpoints on the torus. We call this arc the core tunnel of C. We conjecture that, in any geometrically finite structure on C, the core tunnel is isotopic to a geodesic. By considering Ford domains, we show this conjecture holds for many geometrically finite structures. Additionally, we give an algorithm to compute the Ford domain of such a manifold, and a procedure which has been implemented to visualize many of these Ford domains. Our computer implementation gives further evidence for the conjecture.Comment: 31 pages, 11 figures. V2 contains minor changes. To appear in Experimental Mathematic