Mark de Berg
Bettina Speckmann
ABSTRACT
Over the past decade, the kinetic-data-structures framework has become the standard in computational geometry for dealing with moving objects. A fundamental assumption underlying the framework is that the motions of the objects are known in advance. This assumption severely limits the applicability of KDSs. We study KDSs in the black-box model, which is a hybrid of the KDS model and the traditional time-slicing approach. In this more practical model we receive the position of each object at regular time steps and we have an upper bound on dmax, the maximum displacement of any point in one time step. We study the maintenance of the convex hull and the Delaunay triangulation of a planar point set P in the black-box model, under the following assumption on dmax: there is some constant k such that for any point p ∑ P the disk of radius dmax contains at most k points. We analyze our algorithms in terms of ∑k , the so-called k-spread of P. We show how to update the convex hull at each time step in O(k∑k log2 n) amortized time. For the Delaunay triangulation our main contribution is an analysis of the standard edge-flipping approach; we show that the number of flips is O(k2 ∑k2) at each time step.
- P.K. Agarwal, L.J. Guibas, H. Edelsbrunner, J. Erickson, M. Isard, S. Har-Peled, J. Hershberger, C. Jensen, L. Kavraki, P. Koehl, M. Lin, D. Manocha, D. Metaxas, B. Mirtich, D. Mount, S. Muthukrishnan, D. Pai, E. Sacks, J. Snoeyink, S. Suri, and O. Wolefson. Algorithmic issues in modelling motion. ACM Comput. Surv. 34:550--572 (2002). Google Scholar
Digital Library
- P.K. Agarwal, B. Sadri, and H. Yu. Untangling triangulations through local explorations. In Proc. 24th ACM Sympos. Comput. Geom., pages 288--297, 2008. Google ScholarDigital Library
- J. Basch, L.J. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discr. Algorithms, pages 747--756, 1997. Google ScholarDigital Library
- M. de Berg, M.van Kreveld, M. Overmars, O. Schwartzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany 3rd edition, 2008. Google ScholarDigital Library
- P.M. Manhaes de Castro, J. Tournois, P. Alliez, and O. Devillers. Filtering relocations on a Delaunay triangulation. In phProc. Sympos. Geometry Processing, pages 1465--1474, 2009 Google ScholarDigital Library
- T. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discr. Comput. Geom. 16: 369--387 (1996).Google ScholarDigital Library
- F. Chin, J. Snoeyink and C.A. Wang. Finding the medial axis of a simple polygon in linear time. Discr. Comput. Geom. 21:405--420 (1999).Google ScholarCross Ref
- M. Cho, D.M. Mount, and E. Park. Maintaining nets and net trees under incremental motion. In Proc. 20th Sympos. Algo. Comput., pages 1134--1143, 2009. Google ScholarDigital Library
- O. Devillers. On deletion in Delaunay triangulations. In Proc. 15th ACM Sympos. Comput. Geom., pages 181--188, 1999. Google ScholarDigital Library
- J. Erickson. Dense Point Sets Have Sparse Delaunay Triangulations. Discr. Comput. Geom. 30:83--115 (2005). Google ScholarDigital Library
- J. Gao, L.J. Guibas, A. Nguyen. Deformable spanners and applications. In Proc. 20th ACM Sympos. Comput. Geom., pages 190--199, 2004. Google ScholarDigital Library
- L.J. Guibas. Kinetic data structures--a state-of-the-art report. In Proc. 3rd Workshop Algorithmic Found. Robot., pages 191--209, 1998. Google ScholarDigital Library
- L.J. Guibas. Kinetic data structures. In: D. Mehta and S. Sahni (editors), Handbook of Data Structures and Applications, Chapman and Hall/CRC, 2004.Google Scholar
- L.J. Guibas. Motion. In: J. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry (2nd edition), pages 1117--1134. CRC Press, 2004.Google Scholar
- S. Kahan. A model for data in motion. In Proc. 23rd ACM Sympos. Theory Comput., pages 267--277, 1991. Google ScholarDigital Library
- D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu. A computational framework for incremental motion. In Proc. 20th ACM Sympos. Comput. Geom., pages 200--209, 2004. Google ScholarDigital Library
- D. Russel (2007). Kinetic Datastructures in Practise. Ph.D. thesis. Stanford University: U.S.A. Google ScholarDigital Library
- R. Shewchuk. Star splaying: an algorithm for repairing Delaunay triangulations and convex hulls. In Proc. 21st ACM Sympos. Comput. Geom., pages 237--246, 2005. Google ScholarDigital Library
- K. Yi and Q. Zhang. Multi-dimensional online tracking. In Proc. 20th ACM-SIAM Sympos. Discr. Algo., pages 1098--1107, 2009. Google ScholarDigital Library
Index Terms
- Kinetic convex hulls and delaunay triangulations in the black-box model
Recommendations
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryGiven a set Σ of spheres in Ed, with d≥3 and d odd, having a fixed number of m distinct radii ρ1,ρ2,...,ρm, we show that the worst-case combinatorial complexity of the convex hull CHd(Σ) of Σ is Θ(Σ{1≤i≠j≤m}ninj⌊ d/2 ⌋), where ni is the number of ...
The quickhull algorithm for convex hulls
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm. It ...
Comments