cgal-discuss - [cgal-discuss] sorting of bounding boxes in Box_intersection_d function

Subject: CGAL users discussion list

List archive

[cgal-discuss] sorting of bounding boxes in Box_intersection_d function

From: Andre Massing <>
To:
Subject: [cgal-discuss] sorting of bounding boxes in Box_intersection_d function
Date: Wed, 19 Aug 2009 14:21:36 +0200
Organization: Simula

Hi again :)

In the course of the algorithm, the Box_intersection_b function (bipartite case) reorders the boxes according to the documentation. Since I want to wrap a mesh and to query several times, is there any simple way to keep the reorder list of say the first box list in order to improve the performance for the following queries?

Kind regards,
Andre

[cgal-discuss] sorting of bounding boxes in Box_intersection_d function, Andre Massing, 08/19/2009

List archive

[cgal-discuss] sorting of bounding boxes in Box_intersection_d function