[vtkusers] Working with polygonal meshes

[Bryn Lloyd]

Hi Christiaan,


VTK has many things to offer - and can solve at least some of your points.

> 1. Simple boolean operations.  Union, intersection.

this one might be difficult to solve with VTK.


> 2. Test whether some 3d point is inside the mesh or not.

this can be done with the vtk (vtkOBBTree,  InsideOrOutside or 
IntersectWithLine).


> 3. Calculate the volume of the mesh.

vtkMassProperties::GetVolume()


> 4. Integrate a function over the interior of the mesh. (Though 2 will
> allow me to do this in any case.)

Not sure about this one. There might be some existing filter - or you 
could quite easily build something yourself.




Maybe you should also have a look at the GNU Triangulated Surface Library:
   http://gts.sourceforge.net/

It has a good inside outside test, and can do boolean operation on 
surface meshes.



Cheers
Bryn





> 
> 
> Is vtk suitable for this?  If not, can someone recommend another
> appropriate library that will help me? It seems I might be able to use
> vtk implicit functions somehow, but not so sure.
> 
> Have a great day,
> Chris
> _______________________________________________
> This is the private VTK discussion list.
> Please keep messages on-topic. Check the FAQ at: http://www.vtk.org/Wiki/VTK_FAQ
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers
> 


-- 
-------------------------------------------------
Bryn Lloyd
Computer Vision Laboratory
ETH Zürich, Sternwartstrasse 7
CH - 8092 Zürich, Switzerland
Tel: +41 44 63 27690
Fax: +41 44 63 21199
-------------------------------------------------