Re: half edge data structure
- From: Morris Dovey <mrdovey@xxxxxxxx>
- Date: Mon, 24 Mar 2008 10:13:20 -0500
broli wrote:
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 ?
Eh? Bad Broli! Don't "yabbut" me about optimization without first
providing a clear definition of the final objective. :-)
More seriously, its almost always better to get your application
working before you start worrying about optimization.
My thinking was that if you have the triangle, then you have
direct access to the three sets of vertex coordinates, which
means that you also have the endpoints of all of the edges.
What did I miss?
--
Morris Dovey
DeSoto Solar
DeSoto, Iowa USA
http://www.iedu.com/DeSoto/
.
- References:
- half edge data structure
- From: broli
- Re: half edge data structure
- From: Morris Dovey
- Re: half edge data structure
- From: broli
- half edge data structure
- Prev by Date: Re: How do linkers work?
- Next by Date: Re: The problems in comp.lang.c
- Previous by thread: Re: half edge data structure
- Next by thread: Re: half edge data structure
- Index(es):
Relevant Pages
|