CGAL users discussion list

[Monique Teillaud <>]

Hi,
not an answer, but just an information: there is an implementation of 
this functionality in the 3d circular kernel, which is currently 
submitted to the CGAL editorial board.

(I cannot post the implementation here, because it is not a single 
stand-alone implementation, it is integrated in the whole submited 
kernel with pieces distributed in lots of files...)

        Monique Teillaud

Andreas Fabri wrote:
> Hi Cedric,
>
> this is not implemented.
>
> andreas
>
>
> Cédric LE MAITRE wrote:
>
> > Hi,
> > And happy new year to every CGAL users.
> >
> > i want to compute the intersection point of 2 3D lines.
> > i try this code:
> >
> >    Point_3 ptC1(-4, 0, 0);
> >    Point_3 ptP1(-3, 0.25, 0.25);
> >    Point_3 ptC2(0, -4, 0);
> >    Point_3 ptP2(0.25, -3, 0.25);
> >
> >    Line_3 line1(ptC1, ptP1);
> >    Line_3 line2(ptC2, ptP2);
> >
> >    CGAL::Object result;
> >    result = Kernel::Intersect_3(line1, line2);
> >
> >    Point_3 ptR;
> >    if (CGAL::assign(ptR, result)) {
> >
> >        // handle the point intersection case.
> >        //...
> >    }
> >
> > But it don't compile. i didn't found example which use this function.
> > Please how could i do that ?
> > Thanks,
> >
> > Cedric LE MAITRE
> > --- You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss
>
> --- You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss