Title :
Controllable single-strip generation for triangulated surfaces
Author_Institution :
Dept. of Comput. Sci., California Univ., Irvine, CA, USA
Abstract :
In this paper, we introduce a method to represent a given triangular model using a single triangle strip. Since this problem is NP-complete, we break the limitation by splitting adjacent triangles when necessary. The common edge is split at the mid-point, and the newly formed triangles are coplanar with their parent triangles. Hence, the resulting geometry of the model is visually and topologically identical to the original triangular model. Our method can develop any edge-connected oriented 2-manifold of arbitrary topology, with or without boundary, into a single strip. Our stripification method can be controlled to start and end at triangles incident on specific vertices. Further, an acyclic set of edges of the input model can be marked as "constraint edges" and our method can generate a single strip that does not cross over these edges, but still cover the whole model.
Keywords :
computational complexity; computational geometry; mesh generation; solid modelling; topology; Hamiltonian cycles; Hamiltonian paths; NP-completeness; acyclic edge set; arbitrary topology; constrained path planning; constraint edges; edge-connected oriented 2-manifold; fundamental cycles; geometrical model; single triangle strip; single-strip generation; stripification method; triangular model; triangulated surfaces; Algorithm design and analysis; Application software; Computer graphics; Computer science; Geometry; Path planning; Process control; Solid modeling; Strips; Topology;
Conference_Titel :
Computer Graphics and Applications, 2004. PG 2004. Proceedings. 12th Pacific Conference on
Print_ISBN :
0-7695-2234-3
DOI :
10.1109/PCCGA.2004.1348335