CGAL users discussion list

[Ophir Setter <>]

If you are referring to Arr_conic_traits_2 then they do not support intersection of infinite conics. If you just need the intersection we can search in the code for the way to compute the intersection points.

If you want to construct an arrangement then you should wait for a near future release which will contain the ability to construct arrangement of general algebraic curves.

Regards,
Ophir

On Tue, Jul 6, 2010 at 6:56 AM, Vu, Khuong <> wrote:

Hi everyone,

Does anyone have idea how we can compute the intersection of 2 infinite conic arcs? CGAL provides methods but when I tried to compute the intersection of a infinite hyperbolic arc, say xy - 1 =0, with an ellipse, the segmentation fault occurred. My code just followed CGAL's examples:

...
Conic_arc_2 c1 (0, 0, 1, 0, 0, -1); // xy - 1 =0;
Conic_arc_2 c2 (58, 72, -48, 0, 0, -360); // 58xˆ2 + 72yˆ2 - 48xy - 360 = 0

 std::list<Point_2> pts;
 Conic_arc_2 conic_arcs[ ]= {c1, c2};

 CGAL::compute_intersection_points (conic_arcs, conic_arcs + 2, std::back_inserter (pts));

 std::cout << "Found " << pts.size() << " intersection points: " <<
 std::endl;
 std::copy (pts.begin(), pts.end(),
 std::ostream_iterator<Point_2>(std::cout, "\n"));
...

Any hint would be very appreciated. Thanks so much.

Khuong
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss