|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Computer Graphics and Applications, 12th Pacific Conference on (PG'04)
Controllable Single-Strip Generation for Triangulated Surfaces
Seoul, Korea
October 06-October 08
ISBN: 0-7695-2234-3
| ASCII Text | x | ||
| M. Gopi, "Controllable Single-Strip Generation for Triangulated Surfaces," Computer Graphics and Applications, Pacific Conference on, pp. 61-69, Computer Graphics and Applications, 12th Pacific Conference on (PG'04), 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/PCCGA.2004.1348335, author = {M. Gopi}, title = {Controllable Single-Strip Generation for Triangulated Surfaces}, journal ={Computer Graphics and Applications, Pacific Conference on}, volume = {0}, year = {2004}, issn = {1550-4085}, pages = {61-69}, doi = {http://doi.ieeecomputersociety.org/10.1109/PCCGA.2004.1348335}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Graphics and Applications, Pacific Conference on TI - Controllable Single-Strip Generation for Triangulated Surfaces SN - 1550-4085 SP61 EP69 A1 - M. Gopi, PY - 2004 KW - Triangulation KW - Stripification KW - Hamiltonian paths and cycles KW - Path planning KW - Constrained path planning KW - Fundamental cycles VL - 0 JA - Computer Graphics and Applications, Pacific Conference on ER - | |||
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.
Index Terms:
Triangulation, Stripification, Hamiltonian paths and cycles, Path planning, Constrained path planning, Fundamental cycles
Citation:
M. Gopi, "Controllable Single-Strip Generation for Triangulated Surfaces," pg, pp.61-69, Computer Graphics and Applications, 12th Pacific Conference on (PG'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.
