CGAL users discussion list

[Rifat Aras <>]

Hmm, I guess mesh_polyhedral_domain.cpp is what I am looking for. It generates a 3D mesh for a domain defined by polyhedral surfaces. I will feed this my mesh and then take just the vertices of the resultant 3D mesh.


Thank you for the advice, Rifat.

2011/10/3 Sebastien Loriot (GeometryFactory) <>

Did you have a look at Mesh_3 package?

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Mesh_3/Chapter_main.html

Sebastien.

mq_wei wrote:

Dear all,
I also have this question, many thanks.
 Best regards,
Mingqiang WEI
At 2011-10-03 07:17:54,"Rifat Aras" <> wrote:

   Dear CGAL users,

   I have a triangular closed mesh (like the shell of a sphere). I want
   to sample some 3D points in the volume defined by the convex hull of
   the mesh.

   I think the 3D triangulation class of CGAL is a perfect match for
   this problem. From the manual: "The basic 3D-triangulation class of
   CGAL is primarily designed to represent the triangulations of a set
   of points
   A in R3. It is a partition of the convex hull of A into tetrahedra
   whose vertices are the points of A". Only the last part of this
   definition bugs me a little bit as I want points not only on the
   outer shell but also inside the volume.

   If 3D-triangulation class (or another class of CGAL) will not do the
   job for me, I guess I will need to implement my own sampling
   routine. For that purpose, I have something like the following in my
   mind:

   - Compute the bounding volume of the mesh
   - Shoot a random ray in the bounding volume
   - Find the intersection points of the ray with the mesh
   - Sample some points on the portion of the ray that is inside of the
   mesh
   - Repeat until I have enough points.

   Any comments about this?

   Cheers, Rifat Aras.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss