## Triangle-Strip Algorithm Needed

### Triangle-Strip Algorithm Needed

I'm looking for an algorithm to convert a surface tesselation into one or

more triangle strips to improve graphics speed on OpenGL display hardware.

As input I have a list of points with the topology of the tesselation:
npoints
xyz[3][npoints]
normals[3][npoints]
ntriangles
tris[3][ntriangles]

I would like as output:
nstrips
tris[*][nstrips]

Any help would be appreciated, even a URL.

--
Paul Tallon
Senior Development Engineer
ANSYS Inc.

http://users.sgi.net/~pft

### Triangle-Strip Algorithm Needed

> Hello and Thanks in Advance.

>   I'm looking for an algorithm to convert a surface tesselation into one or

> more triangle strips to improve graphics speed on OpenGL display hardware.

[..]

Quote:>   Any help would be appreciated, even a URL.

I can help with that 8):
Check the homepage of stripe:
http://www.cs.sunysb.edu/~evans/stripe.html

There was a paper about stripe in IEEE Visualization'96.

Dirk

--

======== 8< ======= 8< ======= 8< ======= 8< ======= 8< ======= 8<
========
Dirk Bartz                                      University of Tuebingen
Phone:  +49-7071/29-76361

WWW:   http://www.gris.uni-tuebingen.de/~bartz

### Triangle-Strip Algorithm Needed

|>
|>   I'm looking for an algorithm to convert a surface tesselation into one or
|>
|> more triangle strips to improve graphics speed on OpenGL display hardware.
|>
|>   As input I have a list of points with the topology of the tesselation:
|>            npoints
|>            xyz[3][npoints]
|>            normals[3][npoints]
|>            ntriangles
|>            tris[3][ntriangles]
|>
|>   I would like as output:
|>            nstrips
|>            tris[*][nstrips]
|>
|>   Any help would be appreciated, even a URL.

Try the Stripe project page.  Stripe is freely available for
non commerical use:

http://www.cs.sunysb.edu/~evans/stripe.html

You can also try the "Converting sets of triangles with shared
edges into triangle strips" page:

http://tofu.alt.net/~grantham/meshifier/show.html

By the way, information about these and other cool OpenGL-based
rendering techniques can be found at:

I hope this helps.

- Mark

I'm looking for an algorithm to convert a surface tesselation into one or

more triangle strips to improve graphics speed on OpenGL display hardware.

As input I have a list of points with the topology of the tesselation:
npoints
xyz[3][npoints]
normals[3][npoints]
ntriangles
tris[3][ntriangles]

I would like as output:
nstrips
tris[*][nstrips]

Any help would be appreciated, even a URL.

--
Paul Tallon
Senior Development Engineer
ANSYS Inc.

http://users.sgi.net/~pft

2. earthmap