Iterative\u00a0Stripification of a Triangle Mesh: Focus on Data Structures<\/a>.
\nWSCG 2004 (poster)<\/i>, 133-136.
\nPlzen, Rep.\u00a0Ceca, Febbraio 2004.<\/p>\n","protected":false},"excerpt":{"rendered":"Abstract: In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The Continue Reading …<\/a><\/p>\n","protected":false},"author":2161,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[4,5],"class_list":["post-12","post","type-post","status-publish","format-standard","hentry","category-paper","tag-m-porcu","tag-r-scateni"],"_links":{"self":[{"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts\/12","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/users\/2161"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/comments?post=12"}],"version-history":[{"count":3,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts\/12\/revisions"}],"predecessor-version":[{"id":83,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts\/12\/revisions\/83"}],"wp:attachment":[{"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/media?parent=12"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/categories?post=12"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/tags?post=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![](\"http:\/\/people.unica.it\/riccardoscateni\/files\/2013\/07\/Porcu2004IST.png\")
Abstract<\/b>: In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decrease the number of strips. Our method is a major improvement of a proposed one originally devised for both static and continuous level-of-detail (CLOD) meshes and retains this feature. The usage of a dynamical identification strategy for the strips allows us to drastically reduce the length of the searching paths in the graph needed for the rearrangement and produce loop-free triangle strips without any further controls and post-processing, while requiring a more sophisticated implementation to manage the search and undo operations.<\/p>\n