CODEWITHSUNDEEP
c++cgal
Emerson Max
Emerson Max

Reputation: 61

Return intersection points and objects intersecting

I am a beginner in CGAL and I have a question about the intersections of segments (maybe arcs too).

Given that I have two lists of segments, where each list represents a shape, if I put these two forms to intersect, is there any way to get the points of intersection and yours segments?

Here is a example: http://imagizer.imageshack.us/v2/800x600q90/13/ydtj.png I want the dark green/blue segments and the intersection point in light green/blue. The image shows the two intersections, but for my purpose it was enough only the first intersection.

I thought to iterate through the lists, but I think this may be a naive approach. There is a more accurate and fast way to do this?

Upvotes: 1

Views: 198

Answers (1)

Emerson Max
Emerson Max

Reputation: 61

Somehow get the original primitive. I just used an Arrangement_with_history_2. Can also be used an Arr_curve_data_traits_2 to store the original curve, but it is not as simple as using a history.

In the end, I discovered how to get the original segments, but my problem is still far from being solved.

Thanks for the help.

Upvotes: 1

Related Questions