CGAL users discussion list

["Amir Vaxman" <>]

What I usually do when I need such things is to first find the intersection
of all objects by the supporting plane to the convex polygon, and create the
2D arrangement of these intersections on this plane with CGAL. You can
easily extract what you need from the arrangement (namely, in your case, the
intersection area).

-----Original Message-----
From: mahdavi 
[mailto:]
 
Sent: Saturday, February 27, 2010 12:52 PM
To: 

Subject: [cgal-discuss] intersection polygon by polyhedron


hi,all
I have a question in computational geometry ,how to obtain intersection a
convex polygon by convex polyhedron in 3D?I read a paper by title
"Intersection of Convex Objects in Two and Three
Dimensions" but  its implementation like hard.
thanks.
-- 
View this message in context:
http://n4.nabble.com/intersection-polygon-by-polyhedron-tp1571840p1571840.ht
ml
Sent from the cgal-discuss mailing list archive at Nabble.com.

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