CGAL users discussion list

[Paul Ullrich <>]

Hi all,

I'm thinking of using CGAL in order to tackle a particular problem with 2D
spherical meshing.  Namely, given two tilings (meshes) M1 and M2 which
completely cover the sphere, calculate the intersection mesh -- that is, the
mesh M12 that includes all edges from M1 and M2 and label all faces of M12
with the indices from the original faces of M1 and M2.  Mesh edges can
consist of lines of constant latitude (the arc that is formed from an
intersection between z = constant and the surface of the sphere) or great
circle arcs (the intersection between a plane that passes through the origin
and the surface of the sphere).  The code will need to handle roughly 1
million elements on M1 and M2.

So the question is:  Would you recommend tackling this problem with 3D Nef
polyhedra, the 3D Spherical Geometry Kernel, or some other approach?

Thanks!

~ Paul



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Spherical-Mesh-Intersection-tp4659670.html
Sent from the cgal-discuss mailing list archive at Nabble.com.