CGAL users discussion list

["Jens K. Becker" <>]

Hi Shi,

I am not an expert with CGAL (yet), but I had the same problem. There 
are plenty
of triangulation methods in 3D (all of them work in 3d if I am not mistaken).
The resulting triangulation will be in 3D because infinite points will 
be added
to your point set. If you just check for these points (T.is_infinite(vertex))
and eliminating them should leave you with a triangulation in the plane.

Greetings,

Jens

--
Dr. J.K. Becker
University of Tuebingen - Institute for Geoscience
Sigwartst. 10 - 72076 Tuebingen (Germany)
Tel.: ++49 7071 29 73139   Fax: +49 7071 5059
web: http://www.jkbecker.de


Quoting Shi Yan 
<>:

> hello guys,
>
> i need to do triangulation inside a 3d triangle. the triangulation
> method provided by CGAL seems to be for 2D. so instead of me
> converting the 3D points into a 2D coordinate system, is there any
> convenient CGAL function that can do this for me?
>
> thank you very much.
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss