Results 1  10
of
14
SingleStrip Triangulation of Manifolds with Arbitrary Topology
, 2004
"... Triangle strips have been widely used for efficient rendering. It is NPcomplete 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 cre ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
Triangle strips have been widely used for efficient rendering. It is NPcomplete 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 singlestrip 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.
Reconfigurations of polygonal structures
, 2005
"... This thesis contains new results on the subject of polygonal structure reconfiguration. Specifically, the types of structures considered here are polygons, polygonal chains, triangulations, and polyhedral surfaces. A sequence of vertices (points), successively joined by straight edges, is a polygona ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This thesis contains new results on the subject of polygonal structure reconfiguration. Specifically, the types of structures considered here are polygons, polygonal chains, triangulations, and polyhedral surfaces. A sequence of vertices (points), successively joined by straight edges, is a polygonal chain. If the sequence is cyclic, then the object is a polygon. A planar triangulation is a set of vertices with a maximal number of noncrossing straight edges joining them. A polyhedral surface is a threedimensional structure consisting of flat polygonal faces that are joined by common edges. For each of these structures there exist several methods of reconfiguration. Any such method must provide a welldefined way of transforming one instance of a structure to any other. Several types of reconfigurations are reviewed in the introduction, which is followed by new results. We begin with efficient algorithms for comparing monotone chains. Next, we prove that flat chains with unitlength edges and angles within a wide range always admit reconfigurations, under the dihedral model of motion. In this model, angles and edge lengths are preserved. For the universal
Grid vertexunfolding orthostacks
 International Journal of Computational Geometry and Applications
"... Communicated by Godfried Toussaint Biedl et al. 1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containi ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Communicated by Godfried Toussaint Biedl et al. 1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex unfolding using only such cuts.
Epsilonunfolding orthogonal polyhedra
 Graphs and Combinatorics
"... An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron may be unfolded. Here we prove, via an algorithm, that every o ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron may be unfolded. Here we prove, via an algorithm, that every orthogonal polyhedron (one whose faces meet at right angles) of genus zero may be unfolded. Our cuts are not necessarily along edges of the polyhedron, but they are always parallel to polyhedron edges. For a polyhedron of n vertices, portions of the unfolding will be rectangular strips which, in the worst case, may need to be as thin as ǫ = 1/2 Ω(n). 1
When Can a Net Fold to a Polyhedron?
 In Proceedings of the 11th Canadian Conference on Computational Geometry
, 1999
"... this paper, we study the problem of whether a polyhedron can be obtained from a net , i.e., a polygon and a set of creases, by folding along the creases. We consider two cases, depending on whether we are given the dihedral angle at each crease. If these dihedral angles are given the problem can be ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
this paper, we study the problem of whether a polyhedron can be obtained from a net , i.e., a polygon and a set of creases, by folding along the creases. We consider two cases, depending on whether we are given the dihedral angle at each crease. If these dihedral angles are given the problem can be solved in polynomial time by the simple expedient of performing the folding. If the dihedral angles are not given the problem is NPcomplete, at least for orthogonal polyhedra. We then turn to the actual folding process, and show an example of a net with rigid faces that can, in the sense above, be folded to form an orthogonal polyhedron, but only by allowing faces to intersect each other during the folding process.
Grid vertexunfolding orthogonal polyhedra
 In Proc. 23rd Sympos. Theoret. Aspects Comput. Sci., Lecture Notes Comput. Sci
, 2006
"... An edgeunfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertexunfolding permits faces in t ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
An edgeunfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertexunfolding permits faces in the net to be connected at single vertices, not necessarily along edges. We show that any orthogonal polyhedron of genus zero has a grid vertexunfolding. (There are orthogonal polyhedra that cannot be vertexunfolded, so some type of “gridding ” of the faces is necessary.) For any orthogonal polyhedron P with n vertices, we describe an algorithm that vertexunfolds P in O(n 2) time. Enroute to explaining this algorithm, we present two simpler vertexunfolding algorithms, one for “banded ” objects, and one that requires a 3 ×1 refinement of the vertex grid. 1
Hinged dissections exist
"... We prove that any finite collection of polygons of equal area has a common hinged dissection, that is, a chain of polygons hinged at vertices that can be folded in the plane continuously without selfintersection to form any polygon in the collection. This result settles the open problem about the e ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that any finite collection of polygons of equal area has a common hinged dissection, that is, a chain of polygons hinged at vertices that can be folded in the plane continuously without selfintersection to form any polygon in the collection. This result settles the open problem about the existence of hinged dissections between pairs of polygons that goes back implicitly to 1864 and has been studied extensively in the past ten years. Our result generalizes and indeed builds upon the result from 1814 that polygons have common dissections (without hinges). We also extend our result to edgehinged dissections of solid 3D polyhedra that have a common (unhinged) dissection, as determined by Dehn’s 1900 solution to Hilbert’s Third Problem. Our proofs are constructive, giving explicit algorithms in all cases. For a constant number of planar polygons, both the number of pieces and running time required by our construction are pseudopolynomial. This bound is the best possible even for unhinged dissections. Hinged dissections have possible applications to reconfigurable robotics, programmable matter, and nanomanufacturing.
Two New Classes of Hamiltonian Graphs
, 2007
"... We prove that a triangular grid without local cuts is (almost) always Hamiltonian. This suggests an efficient scheme for rendering triangulated manifolds by graphics hardware. We also show that the Hamiltonian Cycle problem is NPComplete for planar subcubic graphs of arbitrarily high girth. As a by ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that a triangular grid without local cuts is (almost) always Hamiltonian. This suggests an efficient scheme for rendering triangulated manifolds by graphics hardware. We also show that the Hamiltonian Cycle problem is NPComplete for planar subcubic graphs of arbitrarily high girth. As a byproduct we prove that there exist triHamiltonian planar subcubic graphs of arbitrarily high girth.
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
, 2008
"... We give a systematic study of Hamiltonicity of grids—the graphs induced by finite subsets of vertices of the tilings of the plane with congruent regular convex polygons (triangles, squares, or hexagons). Summarizing and extending existing classification of the usual, “square”, grids, we give a compr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give a systematic study of Hamiltonicity of grids—the graphs induced by finite subsets of vertices of the tilings of the plane with congruent regular convex polygons (triangles, squares, or hexagons). Summarizing and extending existing classification of the usual, “square”, grids, we give a comprehensive taxonomy of the grid graphs. For many classes of grid graphs we resolve the computational complexity of the Hamiltonian cycle problem. For graphs for which there exists a polynomialtime algorithm we give efficient algorithms to find a Hamiltonian cycle. We also establish, for any g ≥ 6, a onetoone correspondence between Hamiltonian cycles in planar bipartite maximumdegree3 graphs and Hamiltonian cycles in the class Cg of girthg planar maximumdegree3 graphs. As applications of the correspondence, we show that for graphs in Cg the Hamiltonian cycle problem is NPcomplete and that for any N ≥ 5 there exist graphs in Cg that have exactly N Hamiltonian cycles. We also prove that for the graphs in Cg, a Chinese Postman tour gives a (1 + 8 g)approximation to TSP, improving thereby the Christofides ratio when g> 16. We show further that, on any graph, the tour obtained by Christofides ’ algorithm is not longer than a Chinese Postman tour.