Spatial sorting. CGAL User and Reference Manual: Many geometric algorithms implemented in CGAL are incremental, and thus their speed is dependent on the order of insertion. This package provides sorting algorithms that may considerably improve running times of such algorithms. The rationale is to sort objects along a space-filling curve so that two objects close geometrically will be close in the insertion order with high probability. That way, parts of a data structure that will be looked at during an insertion will probably have been looked at in a recent insertion, and thus probably will be in cache memory instead of main memory. As another side-effect, these sorting functions usually improve memory locality of the data structures produced by incremental algorithms, sometimes leading to speed ups in other algorithm using these data structures. ..
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Caroli, Manuel; Teillaud, Monique: Delaunay triangulations of closed Euclidean (d)-orbifolds (2016)
- De Castro, Pedro Machado Manhães; Devillers, Olivier: Practical distribution-sensitive point location in triangulations (2013)
- Batista, Vicente H. F.; Millman, David L.; Pion, Sylvain; Singler, Johannes: Parallel geometric algorithms for multi-core computers (2010)
- Buchin, Kevin: Constructing Delaunay triangulations along space-filling curves (2009)