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 sp...Show MoreMetadata
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.
Published in: 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.
Date of Conference: 06-08 October 2004
Date Added to IEEE Xplore: 01 November 2004
Print ISBN:0-7695-2234-3
Print ISSN: 1550-4085
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Common Edge ,
- Single Strip ,
- Second Category ,
- First Category ,
- Increase In Count ,
- Path Planning ,
- Single Instance ,
- Basic Algorithm ,
- Triangular Mesh ,
- Delaunay Triangulation ,
- Pseudocode Of Algorithm ,
- Parallel Paths ,
- Left Turn ,
- Adjacent Neighbors ,
- Operator Splitting ,
- Boundary Edges ,
- Triangulated Irregular Network ,
- Fundamental Cycle ,
- Triangle Edges ,
- Hamiltonian Path ,
- Hardness Of Problem ,
- Dual Graph ,
- Linear Order
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Common Edge ,
- Single Strip ,
- Second Category ,
- First Category ,
- Increase In Count ,
- Path Planning ,
- Single Instance ,
- Basic Algorithm ,
- Triangular Mesh ,
- Delaunay Triangulation ,
- Pseudocode Of Algorithm ,
- Parallel Paths ,
- Left Turn ,
- Adjacent Neighbors ,
- Operator Splitting ,
- Boundary Edges ,
- Triangulated Irregular Network ,
- Fundamental Cycle ,
- Triangle Edges ,
- Hamiltonian Path ,
- Hardness Of Problem ,
- Dual Graph ,
- Linear Order