Subject: CGAL users discussion list
List archive
[cgal-discuss] CGAL Polygon_2 Intersection result: why two very close points exist?
Chronological Thread
- From: kyewong <>
- To:
- Subject: [cgal-discuss] CGAL Polygon_2 Intersection result: why two very close points exist?
- Date: Sun, 1 Apr 2012 06:59:26 -0700 (PDT)
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.
- [cgal-discuss] CGAL Polygon_2 Intersection result: why two very close points exist?, kyewong, 04/01/2012
- Re: [cgal-discuss] CGAL Polygon_2 Intersection result: why two very close points exist?, Sebastien Loriot (GeometryFactory), 04/02/2012
Archive powered by MHonArc 2.6.16.