CGAL users discussion list

[Roger Mason <>]

Hello,

I want to find the segments along which Triangle_3's intersect.  I am modelling this on:

http://doc.cgal.org/latest/Kernel_23/group__intersection__linear__grp.html">http://doc.cgal.org/latest/Kernel_23/group__intersection__linear__grp.html

So far I have:

template 
void foo( Triangle_3& a, Triangle_3& b) { 
  std::cout << "The objects are: " << a << " and " << b << std::endl;
  CGAL::cpp11::result_of<K::Intersect_3(Triangle_3<R>, Triangle_3)>::type
   result = intersection(a, b);
}

I call foo like this:

int main () {
.....
   // Now find the Triangle_3:Triangle_3 intersections.
    // Example
    Point_3 p = Point_3(0.3,0.4,0.5);
    Point_3 q = Point_3(0.4,0.5,0.6);
    Point_3 r = Point_3(0.5,0.6,0.7);
    Triangle_3 t = Triangle_3(p,q,r);

    Point_3 pp = Point_3(0.3,0.4,0.5);
    Point_3 qq = Point_3(0.4,0.5,0.6);
    Point_3 rr = Point_3(0.5,0.6,0.7);
    Triangle_3 tt = Triangle_3(pp,qq,rr);

    foo(t,tt);
....
}

I get this error when compiling:

error: ‘Triangle_3 {aka CGAL::Triangle_3<CGAL::Cartesian<double> >}’ is not a template

Thanks for any help.

Roger

---

View this message in context: Intersections of Triangle_3
Sent from the cgal-discuss mailing list archive at Nabble.com.