Multi-path algorithm for triangle strips

2004 ◽  
Author(s):  
P. Vanecek ◽  
I. Kolingerova
Keyword(s):  
Triangle Strips

TEMPLATE-BASED ISOCONTOURING

2006 ◽  
Vol 06 (02) ◽  
pp. 187-204 ◽  
Author(s):  
JAGANNATHAN LAKSHMIPATHY ◽  
WIESLAW L. NOWINSKI ◽  
ERIC A. WERNERT
Keyword(s):  
Linear Time ◽  
Cell Types ◽  
Extraction Process ◽  
Extraction Methods ◽  
Lookup Table ◽  
Graphics Hardware ◽  
A Cell ◽  
Triangle Strips ◽  
Different Cell Types

Different isocontour extraction methods use different cell types (tetrahedral, hexahedral, etc.) depending on the nature of the acquisition grids (structured, unstructured, etc.). The existing isocontouring methods have the following pre-steps for the actual extraction process: (a) identification of cell types, (b) identification of topologically independent instances for each cell type, (c) determination of surface primitives contained in the topologically independent instances and (d) generation of a lookup table such that the name of the entry is an instance of a cell and the entry is the triangle set for that instance. The extraction process outputs the triangles from the lookup table. In this paper we present a novel generic method that enables us to list topologically independent surface primitives called "templates" within any n-polytope cell namely tetrahedra, hexahedra etc. We have also modified the traditional lookup table such that name is the cell instance and the entry is face index representations of all template instances contained in that cell. To show an example, we have applied this approach on a hexahedron and listed the templates and subsequently we have showed how to construct a lookup table. Most modern graphics hardware render triangles faster if they are rendered collectively as triangle strips as opposed to individual triangles. With our modified lookup table approach we can identify triangles in the neighboring cell in a linear time and hence we are able to connect two triangle strips into a longer triangle strip on the fly during the extraction process. We have compared our approach with some existing methods. The following are some of the important features of the method: (1) Simplicity, (2) procedural triangulation and (3) face-index representation.

scholarly journals Streamline Visualization of Diffusion Tensor Data Based on Triangle Strips

2006 ◽  
pp. 271-275 ◽  
Author(s):  
Dorit Merhof ◽  
Markus Sonntag ◽  
Frank Enders ◽  
Christopher Nimsky ◽  
Peter Hastreiter ◽  
...  
Keyword(s):  
Diffusion Tensor ◽  
Triangle Strips ◽  
Tensor Data

scholarly journals Hybrid Visualization for White Matter Tracts using Triangle Strips and Point Sprites

2006 ◽  
Vol 12 (5) ◽  
pp. 1181-1188 ◽  
Author(s):  
Dorit Merhof ◽  
Markus Sonntag ◽  
Frank Enders ◽  
Christopher Nimsky ◽  
Peter Hastreiter ◽  
...  
Keyword(s):  
White Matter ◽  
White Matter Tracts ◽  
Triangle Strips

Comparison of triangle strips algorithms

2007 ◽  
Vol 31 (1) ◽  
pp. 100-118 ◽  
Author(s):  
Petr Vaněček ◽  
Ivana Kolingerová
Keyword(s):  
Triangle Strips
Sign in / Sign up

Export Citation Format

Share Document