Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Re: Intersection of surfaces

Subject: CGAL users discussion list

List archive

[cgal-discuss] Re: Intersection of surfaces


Chronological Thread 
  • From: Roger Mason <>
  • To:
  • Subject: [cgal-discuss] Re: Intersection of surfaces
  • Date: Wed, 25 May 2011 10:10:59 -0700 (PDT)

Hi Sebastien,

Many thanks for your reply.

"Sebastien Loriot (GeometryFactory) [via cgal-discuss]"
<[hidden email]> writes:

> Create two vectors of such bbox (using Bbox_3 of the three points of
> each triangle and the Face_handle) and then do the triangle-triangle
> intersection in the callback.

You mean iterate over the triangles in each surface, putting them in a
vector of bbox?  Something like this (from 61.5)?

// Create the corresponding vector of bounding boxes
std::vector<Box> boxes;
for ( Iterator i = triangles.begin(); i != triangles.end(); ++i)
    boxes.push_back( Box( i->bbox(), i));

Sorry to be so stupid about this, but I don't usually deal with such
abstract programming methods.

I understand perfectly if you don't have time to help further.

Thanks,
Roger


View this message in context: Re: Intersection of surfaces
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.16.

Top of Page