An Iterative\u00a0Stripification Algorithm Based on Dual Graph Operations<\/a>.
\nEurographics\u00a0Conference 2003 (short presentations)<\/i>, 69-75.
\nGranada,\u00a0Spagna, Settembre 2003.<\/p>\n","protected":false},"excerpt":{"rendered":"Abstract: This paper describes the preliminary results obtained using an iterative method for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological 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-10","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\/10","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=10"}],"version-history":[{"count":1,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts\/10\/revisions"}],"predecessor-version":[{"id":11,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/posts\/10\/revisions\/11"}],"wp:attachment":[{"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/media?parent=10"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/categories?post=10"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.unica.it\/cg3hci\/wp-json\/wp\/v2\/tags?post=10"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![](\"http:\/\/people.unica.it\/riccardoscateni\/files\/2013\/07\/Porcu2003AIS.png\")
Abstract<\/b>: This paper describes the preliminary results obtained using an iterative method 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.<\/p>\n