CGAL users discussion list

["Saburoh Sakai" <>]

Hi to All,

 

 I am just new to CGAL, as well as to this
 mailing list, and have some question there by..

 

 I am looking for an algorithm that can
 produce a "section polylines" of arbitrary
 triangle mesh geometry, that is to say,
 a resulting intersection polylines which are
 created by intersecting a geometry with a
 whatever 3d plane.

 

 In a theoretical sence, it might be of a
 trivial problem. There might be nothing
 difficult in a mathematical sence.

 

 But in an implementing sense, surely there
 exists a many ways to accomplish it, and it

 turns out to be not at all trivial.
 

 And especially in the case you are looking
 for a most reliable one which proves to work

 robust and fast for whatever huge/irregular

 triangle mesh geometries,

 much more care & cool techniqs has to be 

 taken on its implementation i believe.

 

 Are any such algorithm available in current
 CGAL or any ways to accomplish this task using
 CGAL?
 
 sorry if my question is of the trivial one
 but I could'nt find such just by giving a
 quick view over those CGAL documents..

 

 thanks in advance,

 Saburoh