Subject: CGAL users discussion list
List archive
- From: Bruno Chareyre <>
- To:
- Subject: [cgal-discuss] using box_intersection_d for more than one query
- Date: Tue, 13 Sep 2011 18:56:11 +0200
Hello, I was wondering if there was a smart way to use box_intersection_d() in this sort of task: Say, I want to find intersections between box B1 and a set {b1,... bN}, then depending on the result I will define a new box B2 to check again. The trivial way would be: box_intersection_d(B1,B1,b1,bN); Box B2(some result of the callback mechanism) box_intersection_d(B2,B2,b1,bN); However, if I understand the algorithm correctly, this will trigger the sorting of {b1,... bN} twice. Correct? Is there a way to avoid? Thanks in advance. Bruno |
- [cgal-discuss] using box_intersection_d for more than one query, Bruno Chareyre, 09/13/2011
- Re: [cgal-discuss] using box_intersection_d for more than one query, Bruno Chareyre, 09/13/2011
- Re: [cgal-discuss] using box_intersection_d for more than one query, Sebastien Loriot (GeometryFactory), 09/14/2011
- Re: [cgal-discuss] using box_intersection_d for more than one query, Bruno Chareyre, 09/21/2011
- Re: [cgal-discuss] using box_intersection_d for more than one query, Bruno Chareyre, 09/13/2011
Archive powered by MHonArc 2.6.16.