Hi,
> > So I can consider the fact that HalfEdge data structure is not > directly > implemented in the version that i m using now(1.8) even though i > haven't > study all through of all the Geometry classes. > Well, the half-edge (or twin-edge) graph which is handled by the HalfEdge-class is tuned to support common requests in striping algos. It builds a static graph and supports stuff like, walking the mesh, find some fan candidates, find holes and other common request. BUT: You can only add triangles. Removing triangles, edges is not supported by the current data-structure to get all the performance we want. > > Now can anyone suggest me pathways if i want to implement the halfedge > data structure within that version 1.8 - probably may sound > daunting and > an attempt of a dare devil for a starter like me, > but i would like to. > You really should look into the algorithm you would like to support and pick the half-edge variation you wand and need afterwards. best regards, johannes ` ------------------------------------------------------------------------- This SF.net email is sponsored by DB2 Express Download DB2 Express C - the FREE version of DB2 express and take control of your XML. No limits. Just data. Click to get it now. http://sourceforge.net/powerbar/db2/ _______________________________________________ Opensg-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/opensg-users
