CGAL users discussion list

[<>]

Hi,

I am trying to triangulate (mesh) convex and concave polyhedra. These 
polyhedra
represent anatomical structures derived from patient CT studies. Each 
polyhedra
consists of a number of closed polygons, where each point in the closed 
polygon
has a single z-coordinate, i.e. all closed polygon points for polygon[i] are
within a single plane.

The structure of the data is very simple:

number of polygons[n]
number of points(tuples),numPoints[0] for polygon[0]
point[0].x,point[0].y,point[0].z....point[numPoints[0]-1].x,point[numPoints[0]-1].y,point[numPoints[0]-1].z
...
number of points, numPoints[n-1]
...

where each value of the tuples is a double.

I need to determine the required mesh quickly and robustly. I have used qhull
for simple testing, but this is limited to convex polyhedra. After forming the
mesh I render it with OpenGL, write a screen buffer to file for each structure
and use the resulting files to determine aperture shapes. Or can I do the
rendering to file with CGAL too?
My primary concern is developing the code to determine the required aperture
shapes, which is almost complete. As such I am not that interested in the
details of the meshing: it just needs to work quickly and robustly!

From what I can gather about cgal it is the correct tool for this complex 
task.
From a quick look in the manual the surface mesher function would seem to be 
up
to the job. Am I correct? If not is there something better suited to the 
task? 
I am sure I am not the first person to have such a requirement.

I would appreciate any assistance

Thank you in advance