Efficient Update Strategies for Geometric Computing with Uncertainty

  • Richard Bruce
  • Michael Hoffmann
  • Danny Krizanc
  • Rajeev Raman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2653)


We consider the problems of computing maximal points and the convex hull of a set of points in 2D, when the points are “in motion.” We assume that the point locations (or trajectories) are not known precisely and determining these values exactly is feasible, but expensive. In our model, the algorithm only knows areas within which each of the input points lie, and is required to identify the maximal points or points on the convex hull correctly by updating some points (i.e. determining exactly their location). We compare the number of points updated by the algorithm on a given instance to the minimum number of points that must be updated by an omniscient adversary in order to provably compute the answer correctly. We give algorithms for both of the above problems that always update at most 3 times as many points as the adversary, and show that this is the best possible. Our model is similar to that of [5,2].


  1. 1.
    A. Borodin and R. El-Yaniv, “Online Computation and Competitive Analysis”, Cambridge University Press, 1998.Google Scholar
  2. 2.
    T. Feder, R. Motwani, R. Panigrahy, C. Olston, and J. Widom, “Computing the Median with Uncertainty”, Proc 32nd ACM STOC, 602–607, 2000.Google Scholar
  3. 3.
    T. Feder, R. Motwani, L. O’Callaghan, C. Olston and R. Panigrahy, “Computing Shortest Paths with Uncertainty”, Proc 20th STAC, LNCS 2607, 355–366.Google Scholar
  4. 4.
    J. Basch, L. Guibas and J. Hershberger, “Data Structures for Mobile Data”, Proc 8th ACM-SIAM SODA.Google Scholar
  5. 5.
    S. Kahan, “A Model for Data in Motion”, STOC 91, 267–277.Google Scholar
  6. 6.
    S. Khanna and W.-C. Tan, “On Computing Functions with Uncertainty”, Proc 20th ACM PODS, 171–182.Google Scholar
  7. 7.
    C. Olston and J. Widom, “Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data”, Proc 26th VLDB, Morgan Kempmann, 144–155.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Richard Bruce
    • 1
  • Michael Hoffmann
    • 1
  • Danny Krizanc
    • 2
  • Rajeev Raman
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of LeicesterLeicesterUK
  2. 2.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA

Personalised recommendations