CGAL users discussion list

[Mariette Yvinec <>]

use Triangulation_euclidean_traits_xy_3 ....
Carefull I am not sure how predicates in this traits are filtered

Pierre Alliez wrote:
> hi all,
>
> Suppose I intersect the edges of a 3D convex polyhedron with a plane. 
> This gives me a set of points. I would like to obtain a 2D 
> triangulation of this point set (any triangulation). Any idea how do 
> achieve this easily? I thought of computing the convex hull of this 
> point set, but this may be an overkill.
>
> Precision: I know the "surface interpolation" trick which turns the 
> voronoi-cell-plane-intersection problem into a Power diagram from the 
> surface interpolation component - and want to try another solution.
>
> thanks!
>
> Pierre
>
> http://www-sop.inria.fr/geometrica/team/Pierre.Alliez/

--
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis