Out-of-Order Event Processing in Kinetic Data Structures

@article{Abam2006OutofOrderEP,
  title={Out-of-Order Event Processing in Kinetic Data Structures},
  author={Mohammad Ali Abam and Pankaj K. Agarwal and Mark de Berg and Hai Yu},
  journal={Algorithmica},
  year={2006},
  volume={60},
  pages={250-273}
}
We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and events may be processed in a wrong order. In traditional KDS’s this can lead to major inconsistencies from which the KDS cannot recover. We present more robust KDS’s for the maintenance of several fundamental structures such as kinetic sorting and kinetic tournament trees, which overcome the difficulty by employing a refined event scheduling and processing technique. We… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

An Approximate Arrangement Algorithm for Semi-Algebraic Curves

  • Int. J. Comput. Geometry Appl.
  • 2007
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Data structures for mobile data

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Robust Geometric Computation

  • Encyclopedia of Algorithms
  • 2008
VIEW 1 EXCERPT

Algorithms for tracking moving objects

L. J. Guibas
  • Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 1117–1134. CRC Press, Boca Raton
  • 2004
VIEW 2 EXCERPTS