CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

The circular polygon as one vertex very close to one side of the quad 
polygon. When computing the intersection, this ends up that the
intersection points of the segments are very close to the original point.

If your application does not need the exact intersection, you can for
example do a polygon simplification of the intersection result by
merging vertices which are too close (removing one vertex out of the
two in your case).

Sebastien.

On 04/01/2012 03:59 PM, kyewong wrote:
> Hi,
> Sorry to interrupt you on this function in CGAL. Currently I use
> Exact_predicates_exact_constructions_kernel as kernel type to compute the
> intersection of two polygons (as attached, 0.txt and 1.txt). However, in the
> result (2.txt), I always find that there are two points who are very close
> to each other (Points 2 and 3), which affect the calculation very much.
> I'd like to know if it is the problem of my data or that of CGAL please? If
> CGAL, then why it occurs and how it can be avoided please?
> Thanks very much!
>
> http://cgal-discuss.949826.n4.nabble.com/file/n4523438/0.txt 0.txt
> http://cgal-discuss.949826.n4.nabble.com/file/n4523438/1.txt 1.txt
> http://cgal-discuss.949826.n4.nabble.com/file/n4523438/2.txt 2.txt
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/CGAL-Polygon-2-Intersection-result-why-two-very-close-points-exist-tp4523438p4523438.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.