mirror of https://github.com/CGAL/cgal
Example with parallel build
This commit is contained in:
parent
2818986299
commit
3f28ea958f
|
|
@ -43,6 +43,11 @@ create_single_source_cgal_program( "iso_rectangle_2_query.cpp" )
|
||||||
|
|
||||||
create_single_source_cgal_program( "nearest_neighbor_searching.cpp" )
|
create_single_source_cgal_program( "nearest_neighbor_searching.cpp" )
|
||||||
|
|
||||||
|
find_package( TBB QUIET )
|
||||||
|
if(TBB_FOUND)
|
||||||
|
cgal_target_use_TBB(nearest_neighbor_searching)
|
||||||
|
endif()
|
||||||
|
|
||||||
create_single_source_cgal_program( "searching_with_circular_query.cpp" )
|
create_single_source_cgal_program( "searching_with_circular_query.cpp" )
|
||||||
|
|
||||||
create_single_source_cgal_program( "searching_with_point_with_info.cpp" )
|
create_single_source_cgal_program( "searching_with_point_with_info.cpp" )
|
||||||
|
|
|
||||||
|
|
@ -20,6 +20,9 @@ int main() {
|
||||||
|
|
||||||
Tree tree(points.begin(), points.end());
|
Tree tree(points.begin(), points.end());
|
||||||
|
|
||||||
|
// The tree can be built in parallel
|
||||||
|
tree.build<CGAL::Parallel_if_available_tag>();
|
||||||
|
|
||||||
Point_d query(0,0);
|
Point_d query(0,0);
|
||||||
|
|
||||||
// Initialize the search structure, and search all N points
|
// Initialize the search structure, and search all N points
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue