Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/PCCGA.2004.1348335 | Pacific Conference on Computer Graphics and Applications |
Keywords | Field | DocType |
original triangular model,whole model,common edge,stripification,triangulated surfaces,input model,triangulation,single triangle strip,triangles incident,stripification method,triangular model,constrained path planning,controllable single-strip generation,path planning,arbitrary topology,fun- damental cycles.,hamiltonian paths and cycles,single strip,topology,computational complexity,computational geometry,hamiltonian path,mesh generation | Topology,Triangle strip,Vertex (geometry),Computer science,Computational geometry,CPCTC,Triangulation,Triangulation (social science),Nested triangles graph,Geometry,Mesh generation | Conference |
ISBN | Citations | PageRank |
0-7695-2234-3 | 6 | 0.46 |
References | Authors | |
15 | 1 | |