Re: half edge data structure

On Mar 24, 7:29 pm, Morris Dovey <mrdo...@xxxxxxxx> wrote:


It appears to me that it should be sufficient to work your way
through the triangles and use the vertex indices to get at the
vertex coordinates.

Yes, but wouldn't it be very inefficient to traverse through say 1200
triangles and then for each triangle prepare list of edges, then
prepare common vertex list, common edge list etc ?
.

Relevant Pages

  • Re: Decimation Methods
    ... I also thought initially that vertex coordinates would not matter but ... is lets say per fragment limited in this case larger triangles would ... In such cases vertex coordinates would also affect performance. ... It doesn't happen as often as it should, because scientists ...
    (comp.graphics.api.opengl)
  • Re: Decimation Methods
    ... I also thought initially that vertex coordinates would not matter but ... is lets say per fragment limited in this case larger triangles would ... consume larger ... In such cases vertex coordinates would also affect performance. ...
    (comp.graphics.api.opengl)
  • Re: half edge data structure
    ... vertex coordinates. ... triangles and then for each triangle prepare list of edges, ... Bad Broli! ... working before you start worrying about optimization. ...
    (comp.lang.c)
  • Re: half edge data structure
    ... vertex coordinates. ... triangles and then for each triangle prepare list of edges, ... Duplicate edge records ... contain references to its three edges in the edge list. ...
    (comp.lang.c)
  • Is there any Performance difference between usage of GL_TRIANGLES and GL_GUADS.
    ... I want to render a rectangle with Texture mapping. ... Vertex indices to create a Quad using two Triangles. ...
    (comp.graphics.api.opengl)