CGAL users discussion list

[Andreas Fabri <>]

Hello,

Either you  apply an affine transformation in order
to map the points on the xy plane and then mesh.

Or you do this on the fly:
The mesh algorithms as well as the triangulation classes
are parameterized with a class with a typedef for what
is considered as a point, and predicates and constructions
for this point type. So if you define  the 3D point as
the point type and write predicates like orientation tests
that operate on points in your plane p, this should do
the job on the 3D points.

The  trianguation classes are further parameterized with
a trinagluation data  structure which in turn is parameterized
with the vertex type.  You might have your own 3D vertex
class which stores the Vertex_handles of the polyhedron
vertices in case the plsg is a face of a Polyhedron_3

andreas


sanlington wrote:
>  Hi,everyone
>  
>   I need to mesh a planar straight line graph(PSLG),but it is in three 
> dimension ,not in 2 dimension, that means all the constraints falls in 
> the same plane p,and p is in 3 dimension space.
>   Does CGAL provide some functions to handle this problem ?
>  
>  
>
>
> ------------------------------------------------------------------------
> ?? ?? ?? ?? ?? ?? --- ?? ?? ?? ?? ?? ?? ??166 ?? ?? ?? ?? ?? ?? ?? 
> <http://event.mail.163.com/chanel/click.htm?from=NO_26&domain=163>