|
Boost : |
From: Fernando Cacciola (fernando_cacciola_at_[hidden])
Date: 2007-04-16 08:29:54
Hi John,
> I think CGAL has a half-edge (or maybe double-edge) mesh.
Right, CGAL offers a halfedge data-structure.
Furthermore, the next CGAL version will offer a BGL package that allows
users to pass combinatorial data structures (polyhedrons (HE),
triangulations, etc), as-is, to BGL algorithms (using external adapatation),
or to implement new structure-independent algorithms following the BGL
paradigm, like the forthcoming Surface Mesh Simplification package.
> I think that it would be good if you can
> at least
> model the BGL Concepts, so that the BGL algorithms can be applied to
> the mesh.
>
I would consider this a requirement.
> There is a much more generic concept than half-edge (HE) meshes
> called a 'lath' mesh
Interesting.
I was just in the need for such a reference, thank you :)
> I gather from the boost discussions that nobody has yet even settled
> on
> a boost-approved point & vector concept or class (uBlas has c_vector,
> and gil has point2 but that is kind of internal to the library and not
> intended to be for general use). Would this library include those?
>
IMHO, given that these primitives spread a few computing domains and
everyone has its own idea about it, I would refrain from trying to
"formalize" them in the current library.
Instead, I would make sure the library works fine with your prefered
point/vector type.
I would just include a simple proof-of-concept primitive.
Best
-- ------ Fernando Cacciola SciSoft http://certuscode.wordpress.com http://fcacciola.50webs.com http://fcacciola.wordpress.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk