CGAL users discussion list

[Niklas Hambüchen <>]

Hi,

I'm learning about CGAL's TBB-based parallelism features, such as:

* parallel spatial sorting
* parallel KD tree creation
* parallel triangulation creation

What I can't conclude from the docs:
Do these functions guarantee determinism (scheduling will not affect the 
results), or even guarantee to give the exact same results as their 
sequential variants?

I imagine that divide-and-conquer methods like KD trees and sorting should 
make determinism easy, while for triangulations I can imagine that the order 
of point insertions will make it hard.

Beyond those specific cases:
What is CGAL's general stance on parallelism determinism -- is the library's 
default goal to provide determinism, or can it only be expected if explicitly 
documented?

I would like to make my use cases faster with parallelism, but only if I do 
not lose determinism for reproducibility.

Thanks for the info!
Niklas