CGAL users discussion list

[<>]

Hi,

I have made some inroads with CGAL using the examples provided in the users
manual. I can read in 3D data points (Points_3) into a STL vector. The points
are the edge vertices of a number of (closed) polygons which define a
polyhedra. Each closed polygon has a single z-coordinate. Thus I need to
generate a triangular mesh.

My questions are :

i) how to assign these 3D points to a Surface (required to determine 3D mesh 
of
the polyhedra)
ii) how to determine the mesh 

Additionally I would like to determine the nearest neighbours of points i.e.
next and previous point within current polygon and the nearest neighbouring
point in the adjacent polygons (i.e. immediately above and below current
polygon point- asssuming the current polygon is not the lowest/uppermost
polygon) . The "in-polygon" neighbours should be fairly simple to determine,
but the "adjacent-polygon" neighbours is more tricky.  This is complicated by
the fact that the polyhedra may be split i.e. more than one polygon may be
present for a given z-coordinate , for example left and right or 
dorsal/ventral

Thank you in anticipation

Mark