SpringerLink
Log in

Out-of-Order Event Processing in Kinetic Data Structures

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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 prove that the new event scheduling mechanism leads to a KDS that is correct except for finitely many short time intervals. We analyze the maximum delay of events and the maximum error in the structure, and we experimentally compare our approach to the standard event scheduling mechanism.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Spain)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal, P.K., Guibas, L.J., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 353–374 (2001)

    MATH  MathSciNet  Google Scholar 

  2. Agarwal, P.K., Gao, J., Guibas, L.J.: Kinetic medians and kd-trees. In: Proc. 10th European Sympos. Algorithms, pp. 5–16 (2002)

  3. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. J. Comput. Syst. Sci. 66, 207–243 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51, 606–635 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alexandron, G., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Theory Appl. 36, 144–158 (2006)

    MathSciNet  Google Scholar 

  6. Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proc. 13th Annu. Sympos. Comput. Geom., pp. 344–351 (1997)

  7. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–28 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. The CGAL Library, http://www.cgal.org/

  9. Collins, G., Akritas, A.: Polynomial real root isolation using Descarte’s rule of signs. In: Proc. 3rd ACM Sympos. Symbol. Algebra Comput., pp. 272–275 (1976)

  10. The Core Library, http://www.cs.nyu.edu/exact/

  11. Fortune, S.: Progress in computational geometry. In: Martin, R. (ed.) Directions in Geometric Computing, pp. 81–128. Information Geometers Ltd., Winchester (1993)

    Google Scholar 

  12. Funke, S., Klein, C., Mehlhorn, K., Schmitt, S.: Controlled perturbation for Delaunay triangulations. In: Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pp. 1047–1056 (2005)

  13. Guibas, L.J.: Algorithms for tracking moving objects. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 1117–1134. CRC Press, Boca Raton (2004)

    Google Scholar 

  14. Guibas, L.J., Karavelas, M.: Interval methods for kinetic simulation. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 255–264 (1999)

  15. Guibas, L.J., Russel, D.: An empirical comparison of techniques for updating Delaunay triangulations. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 170–179 (2004)

  16. Guibas, L.J., Karavelas, M., Russel, D.: A computational framework for handling motion. In: Proc. 6th Workshop on Algorithm Engineering and Experiments, pp. 129–141 (2004)

  17. Halperin, D., Shelton, C.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Theory Appl. 10, 273–287 (1998)

    MATH  MathSciNet  Google Scholar 

  18. Jacobson, N.: Basic Algebra I, 2nd edn. Freeman, New York (1985)

    MATH  Google Scholar 

  19. Mehlhorn, K., Osbild, R., Sagraloff, M.: Reliable and efficient computational geometry via controlled perturbation. In: Proc. 33rd Internat. Colloq. Automat. Langu. Program., pp. 299–310 (2006)

  20. Milenkovic, V., Sacks, E.: An approximate arrangement algorithm for semi-algebraic curves. Int. J. Comput. Geom. Appl. 17, 175–198 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  21. Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 597–632. Elsevier, Amsterdam (2000)

    Chapter  Google Scholar 

  22. Yap, C.: Robust geometric computation. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 927–952. CRC Press, Boca Raton (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MADALGO Center, Aarhus University, Aarhus, Denmark

    Mohammad Ali Abam

  2. Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands

    Mark de Berg

  3. Department of Computer Science, Duke University, Durham, NC, 27708, USA

    Pankaj K. Agarwal & Hai Yu

Authors
  1. Mohammad Ali Abam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pankaj K. Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark de Berg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hai Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hai Yu.

Additional information

M.A. was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 612.065.307. M.d.B. was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301. P.A. and H.Y. were supported by NSF under grants CCR-00-86013, EIA-01-31905, CCR-02-04118, and DEB-04-25465, by ARO grants W911NF-04-1-0278 and DAAD19-03-1-0352, and by a grant from the US–Israel Binational Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abam, M.A., Agarwal, P.K., de Berg, M. et al. Out-of-Order Event Processing in Kinetic Data Structures. Algorithmica 60, 250–273 (2011). https://doi.org/10.1007/s00453-009-9335-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9335-y

Search

Navigation