Abstract
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].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Borodin and R. El-Yaniv, “Online Computation and Competitive Analysis”, Cambridge University Press, 1998.
T. Feder, R. Motwani, R. Panigrahy, C. Olston, and J. Widom, “Computing the Median with Uncertainty”, Proc 32nd ACM STOC, 602–607, 2000.
T. Feder, R. Motwani, L. O’Callaghan, C. Olston and R. Panigrahy, “Computing Shortest Paths with Uncertainty”, Proc 20th STAC, LNCS 2607, 355–366.
J. Basch, L. Guibas and J. Hershberger, “Data Structures for Mobile Data”, Proc 8th ACM-SIAM SODA.
S. Kahan, “A Model for Data in Motion”, STOC 91, 267–277.
S. Khanna and W.-C. Tan, “On Computing Functions with Uncertainty”, Proc 20th ACM PODS, 171–182.
C. Olston and J. Widom, “Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data”, Proc 26th VLDB, Morgan Kempmann, 144–155.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruce, R., Hoffmann, M., Krizanc, D., Raman, R. (2003). Efficient Update Strategies for Geometric Computing with Uncertainty. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive