Hello Christoph,
Christoph John wrote:
> Hello Carsten,
> thanks for the link. I am not interested in colission detection, it was just
> stated in the tutorial as an example.
> I am interested in finding the user selection in somewhat larger range scan
> datasets of 100000 and more vertices. As I have to process the selection
> afterwards (selection of the local neighborhood subject to some constraints),
> it has to be quick.
> I have another question concerning selection of the local neighborhood. I
> think the best way to do that is based on a half edge data structure.
> I have read somewhere, I think it was related to OpenSGPlus, that it is
> planed to integrate OpenMesh (www.openmesh.org) as a geometry kernel into
> OpenSG.
unfortunately I don't know the details of this, but I think OpenMesh at
some point dropped support for OpenSG again. Maybe someone else here
knows more about it or can even give some hints on how much work it
would be to revive that integration.
> Therefore I thought to use it in my project as well. But I have now seen that
> there is already a half edge data structure implementation in OpenSG. Have
> you made some experience with it and recommend it or would it be better to
> use OpenMesh instead.
> I think I need to state further that the data structure is only relevant for
> polygon selection.
> I am not interested in other algorithms which come with OpenMesh like
> mesh-smoothing, etc.
the half edge data structure in OpenSG is only used by the geometry
striper and is geared towards that use, therefore I have no experience
using it, sorry.
Carsten
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Opensg-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/opensg-users
