Part of the Khronos Group
OpenGL.org

The Industry's Foundation for High Performance Graphics

from games to virtual reality, mobile phones to supercomputers

Results 1 to 3 of 3

Thread: Algorithm for building triangle strips

  1. #1
    Junior Member Regular Contributor
    Join Date
    Dec 2002
    Location
    Poland
    Posts
    232

    Algorithm for building triangle strips

    Hello!

    I was thinking how can I convert my mesh which is built from seperate triangles to triangle strips. I know that there are some algorithms to do that. I would be thankful for your suggestions.

    Thanx

  2. #2
    Super Moderator OpenGL Lord
    Join Date
    Dec 2003
    Location
    Grenoble - France
    Posts
    5,655

    Re: Algorithm for building triangle strips

    Google "triangle strips" + I feel lucky = http://www.codercorner.com/Strips.htm

    GNU Triangulated Surface library : http://gts.sourceforge.net/

    There also NVTriStrip that can preproccess that, and someone made a faster and more robust implementation but can't find it right now.

    PS : and do not forget that strips are quite good, but waste the vertex cache. It is better to avoid long thin strips in favor of shorter, "square" strips.

    [This message has been edited by ZbuffeR (edited 02-06-2004).]

    [This message has been edited by ZbuffeR (edited 02-06-2004).]

    [This message has been edited by ZbuffeR (edited 02-06-2004).]

  3. #3
    Junior Member Regular Contributor
    Join Date
    Dec 2002
    Location
    Poland
    Posts
    232

    Re: Algorithm for building triangle strips

    Thanks a lot!

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •