CGAL users discussion list

[goshhukha <>]

Stefan, I can't agree with you on this. This is because if this were my code:

  Polygon_2 P;
  P.push_back (Point_2 (0,0));
  P.push_back (Point_2 (1,0));
  P.push_back (Point_2 (0,1));

  std::cout << "P = "; print_polygon (P);

  Polygon_2 Q;
  Q.push_back(Point_2 (1,0));
  Q.push_back(Point_2 (1,1));
  Q.push_back(Point_2 (0,1));
  std::cout << "Q = "; print_polygon (Q);

  if ((CGAL::do_intersect (P, Q)))
    std::cout << "The two polygons intersect in their interior." <<
std::endl;
  else
    std::cout << "The two polygons do not intersect." << std::endl;

  return 0;


Then do_intersect will return a false, depite that P and Q also sharing two
of the same points. 



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Bug-with-do-intersect-tp4656236p4656241.html
Sent from the cgal-discuss mailing list archive at Nabble.com.