CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

It is not clear if your primitives lies in a common plane or if they
are general 3D primitives.

If they are general 3D primitives, you should triangulate you polygons
first and then use the Intersecting Sequences of dD Iso-oriented Boxes
package [1].

Sebastien.

[1] http://doc.cgal.org/latest/Box_intersection_d/index.html

On 11/12/2015 06:38 PM, houssen wrote:
> Hello,
>
> I need to intersect polygons, or lines, made of 3D points : is this
> possible with CGAL ?
>
> I am new to CGAL.
>
> First, I checked out the doc to intersect polygons, or lines, made of 2D
> points (x, y):
> http://doc.cgal.org/latest/Sweep_line_2/index.html
> http://doc.cgal.org/latest/Boolean_set_operations_2/index.html (in
> particular section 3.3)
> I went accross the tutorials without any problem using Point_2,
> Segment_2 and Polygon_2.
>
> Then, I looked at the doc related to using 3D points instead of 2D
> points (http://doc.cgal.org/latest/Polygon/index.html - section 2.3): it
> seems at least some operations are possible (for example, is_simple).
>
> Now, I try to turn my basic tutorial into 3D space : basically, I tried
> to replace Point_2 by Point_3, Segment_2 by Segment_3, Polygon_2 by
> Polygon_3 the "naive" way, this seems not to be possible.
> CGAL::compute_subcurves turns out to be unable to support Segment_3,
> right ? Also Polygon_3 does not seem to exist ! :D
>
> Can I compute intersections of polygons, or lines, made of 3D points (x,
> y, z) with CGAL ?
>
> Franck