Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] do_intersect for pairs of tetrahedrons?

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] do_intersect for pairs of tetrahedrons?


Chronological Thread 
  • From: Amy Tabb <>
  • To:
  • Subject: Re: [cgal-discuss] do_intersect for pairs of tetrahedrons?
  • Date: Tue, 28 Jul 2009 15:41:38 -0400

Hello Andre,

There is section of the manual on the intersection (or generally, Boolean ops) of Nef Polyhedra: http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/Nef_3/Chapter_main.html

There are two papers that discuss the complexity of the operations in depth; I cannot vouch for the speed however as I have not used this feature.

Best
Amy


Andre Massing wrote:
Hi,

ATM I am studying a certain kind of finite element methods with overlapping meshes. Therefore I am adding some intersection functionality to our mesh classes (belonging to the problem solving environment http://www.fenics.org/wiki/DOLFIN). These corresponds to the functionality provided by CGAL: A boolean function "do_intersect" and an "intersection" function, which computes the actual intersection in terms of Nef Polygons.
Depending on the dimension a mesh is purely build up by segments, triangles or tetrahedrons. Everything is fine except that I am sticking with 3d case. So is there an easy (and fast?) work around for the missing do_intersect function, which takes two tetrahedrons (or even 2 Nef_3 polyhedrons)? Any hints or pointers are very much appreciated!

Kind regards,
Andre



--
Amy Tabb
PhD candidate
Robot Vision Laboratory
Electrical and Computer Engineering Department
465 Northwestern Avenue
West Lafayette, Indiana 47907-2035




Archive powered by MHonArc 2.6.16.

Top of Page