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: ochyomdu <>
  • To:
  • Subject: [cgal-discuss] Re: Intersection of two CONVEX 3D polyhedrons
  • Date: Thu, 19 Apr 2012 06:32:02 -0700 (PDT)

Hallo Dimitris.

The easiest way to calculate intersection of two polyhedrons is using of
class Nef_Polyhedron_3.

If You need to use some functions from Polyhedron_3 You can just convert
Polyhedron_3 into Nef_Polyhedron_3 (using constructor), calculate
intersection of polyhedrons and convert the resulting Nef_Polyhedron_3 into
Polyhedron_3 back (using function convert_to_polyhedron()).

Intersection is calculated with operation *
N1*N2

You find more information about Nef_Polyhedron_3 here:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Nef_3/Chapter_main.html

Much success!

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



Archive powered by MHonArc 2.6.16.

Top of Page