Out-of-order event processing in kinetic data structures

Authors:
Mohammad Ali Abam;Pankaj K. Agarwal;Mark de Berg;Hai Yu
Affiliations:
Department of Mathematics and Computing Science, TU Eindhoven, MB Eindhoven, The Netherlands;Department of Computer Science, Duke University, Durham, NC;Department of Mathematics and Computing Science, TU Eindhoven, MB Eindhoven, The Netherlands;Department of Computer Science, Duke University, Durham, NC
Venue:
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Year:
2006

Citing 12
Cited 1

Proximity problems on moving points

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A perturbation scheme for spherical arrangements with application to molecular modeling

Computational Geometry: Theory and Applications - special issue on applied computational geometry
Interval methods for kinetic simulations

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data

Journal of Algorithms
Kinetic Medians and kd-Trees

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial real root isolation using Descarte's rule of signs

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Indexing moving points

Journal of Computer and System Sciences - Special issue on PODS 2000
An empirical comparison of techniques for updating Delaunay triangulations

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points

Journal of the ACM (JACM)
Controlled perturbation for Delaunay triangulations

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An approximate arrangement algorithm for semi-algebraic curves

Proceedings of the twenty-second annual symposium on Computational geometry
Kinetic and dynamic data structures for convex hulls and upper envelopes

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Robust Kinetic Convex Hulls in 3D

ESA '08 Proceedings of the 16th annual European symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 two fundamental structures, kinetic sorting and 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.