The shuffling buffer - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2001

The shuffling buffer


The complexity of randomized incremental algorithms is analyzed with the assumption of a random order of the input. To guarantee this hypothesis, the n data have to be known in advance in order to be mixed what contradicts with the on-line nature of the algorithm. We present the shuffling buffer technique to introduce sufficient randomness to guarantee an improvement on the worst case complexity by knowing only k data in advance. Typically, an algorithm with $O(n^2)$ worst-case complexity and O(n) or O(n log n) randomized complexity has an O((n^2 log k)/k) complexity for the shuffling buffer. We illustrate this with binary search trees, the number of Delaunay triangles or the number of trapezoids in a trapezoidal map created during an incremental construction.
Fichier principal
Vignette du fichier
TheShufflingBuffer.pdf (290.08 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00412567 , version 1 (02-09-2009)



Olivier Devillers, Philippe Guigue. The shuffling buffer. International Journal of Computational Geometry and Applications, 2001, 11, pp.555-572. ⟨10.1142/S021819590100064X⟩. ⟨inria-00412567⟩
134 View
176 Download



Gmail Mastodon Facebook X LinkedIn More