Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Re: Intersection of two CONVEX 3D polyhedrons

Subject: CGAL users discussion list

List archive

[cgal-discuss] Re: Intersection of two CONVEX 3D polyhedrons


Chronological Thread 
  • From: sgdimitris <>
  • To:
  • Subject: [cgal-discuss] Re: Intersection of two CONVEX 3D polyhedrons
  • Date: Wed, 18 Apr 2012 04:40:52 -0700 (PDT)

Really Thanks for the answers! But I have some questions.
*Sebastien:* I have seen that convex hull cannot be calculated if the
parameters x,y,z of the points are not integers. Am I right or did I do
something wrong? Cause the points that intersection produces has parameters
that are not integers.
*Olivier:* What do you mean by dualize? Sorry, but I didn't understand it,
maybe cause I'm not so experienced in using cgal.

In internet, I see that a method to calculate the intersection of the two
convex polyhedrons is:
"convert both polyhedra to planes, take the union of these sets planes and
convert it to vertex representation"
Is it a correct way? If yes, how can I implement that in cgal?

Any help would be really appreciated.
Best regards,
Dimitris


--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-tp4564202p4567440.html
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.16.

Top of Page