Advertisement

Algorithmica

, Volume 81, Issue 9, pp 3519–3533 | Cite as

Two Approaches to Building Time-Windowed Geometric Data Structures

  • Timothy M. ChanEmail author
  • John Hershberger
  • Simon Pratt
Article

Abstract

Given a set of geometric objects each associated with a time value, we wish to determine whether a given property is true for a subset of those objects whose time values fall within a query time window. We call such problems time-windowed decision problems, and they have been the subject of much recent attention, for instance studied by Bokal et al. (in: Proceedings of the 31st International Symposium on Computational Geometry (SoCG), pp 240–254, 2015). In this paper, we present new approaches to this class of problems that are conceptually simpler than Bokal et al. ’s, and also lead to faster algorithms. For instance, we present algorithms for preprocessing for both the time-windowed 2D diameter decision problem and the time-windowed 2D convex hull area decision problem in \(O(n \log n)\) time, improving Bokal et al. ’s \(O(n \log ^2 n)\) and \(O(n \log n \log \log n)\) solutions respectively. Our first approach is to reduce time-windowed decision problems to a generalized range successor problem, which we solve using a novel way to search range trees. Our other approach is to use dynamic data structures directly, taking advantage of a new observation that the total number of combinatorial changes to a planar convex hull is linear for any FIFO update sequence, in which deletions occur in the same order as insertions. We also apply these approaches to obtain the first \(O(n\, \mathrm{polylog}\, n)\) algorithms for the time-windowed 3D diameter decision and 2D orthogonal segment intersection detection problems.

Keywords

Geometric data structures Time window Range searching Dynamic convex hull 

Notes

Acknowledgements

We wish to thank Haim Kaplan and Micha Sharir for their suggestions, which led to an improvement of an earlier version of Lemma 3.1.

References

  1. 1.
    Agarwal, P.K., Matoušek, J.: Dynamic half-space range reporting and its applications. Algorithmica 13(4), 325–345 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Agarwal, P.K., Sharir, M.: Off-line dynamic maintenance of the width of a planar point set. Comput. Geom. Theory Appl. 1, 65–78 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Amato, N.M., Goodrich, M.T., Ramos, E.A.: Parallel algorithms for higher-dimensional convex hulls. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 683–694 (1994)Google Scholar
  4. 4.
    Bannister, M.J., Devanny, W.E., Goodrich, M.T., Simons, J.A., Trott, L.: Windows into geometric events: data structures for time-windowed querying of temporal point sets. In: Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG), pp. 11–19 (2014)Google Scholar
  5. 5.
    Bokal, D., Cabello, S., Eppstein, D.: Finding all maximal subsequences with hereditary properties. In: Proceedings of the 31st International Symposium on Computational Geometry (SoCG), pp. 240–254 (2015)Google Scholar
  6. 6.
    Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 617–626 (2002)Google Scholar
  7. 7.
    Chan, T.M.: Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM 48(1), 1–12 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chan, T.M.: A fully dynamic algorithm for planar width. In: Proceedings of the 17th Annual Symposium on Computational Geometry (SoCG), pp. 172–176 (2001)Google Scholar
  9. 9.
    Chan, T.M.: A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM 57(3), 16:1–16:15 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chan, T.M.: Persistent predecessor search and orthogonal point location on the word RAM. ACM Trans. Algorithms 9(3), 22 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Chan, T.M.: Dynamic geometric data structures via shallow cuttings. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG) (2019)Google Scholar
  12. 12.
    Chan, T.M., Larsen, K.G., Pătraşcu, M.: Orthogonal range searching on the RAM, revisited. In: Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG), pp. 1–10 (2011)Google Scholar
  13. 13.
    Chan, T.M., Pratt, S.: Time-windowed closest pair. In: Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG) (2015)Google Scholar
  14. 14.
    Chan, T.M., Pratt, S.: Two approaches to building time-windowed geometric data structures. In: Proceedings of the 32nd International Symposium on Computational Geometry (SoCG), pp. 28:1–28:15 (2016)Google Scholar
  15. 15.
    Chan, T.M., Tsakalidis, K.: Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. Discrete Comput. Geom. 56(4), 866–881 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inf. Theory 31(4), 509–517 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1(1–4), 133–162 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Chazelle, B., Guibas, L.J.: Fractional cascading: II. Applications. Algorithmica 1(1–4), 163–191 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387–421 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Eppstein, D.: Incremental and decremental maintenance of planar width. J. Algorithms 37(2), 570–577 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Hershberger, J., Suri, S.: Offline maintenance of planar configurations. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 32–41 (1991)Google Scholar
  22. 22.
    Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32(2), 249–267 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2495–2504 (2017)Google Scholar
  24. 24.
    Mulmuley, K.: Randomized multidimensional search trees: lazy balancing and dynamic shuffling. In: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 180–196 (1991)Google Scholar
  25. 25.
    Munro, J.I.: Tables. In: Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 37–42 (1996)Google Scholar
  26. 26.
    Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166–204 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Pratt, S.: Three approaches to building time-windowed geometric data structures. Master’s thesis, Cheriton School of Computer Science, University of Waterloo (2016). https://uwspace.uwaterloo.ca/handle/10012/10654
  28. 28.
    Preparata, F.P.: An optimal real-time algorithm for planar convex hulls. Commun. ACM 22(7), 402–405 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)CrossRefzbMATHGoogle Scholar
  30. 30.
    Schwarzkopf, O.: Dynamic maintenance of geometric structures made easy. In: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 197–206 (1991)Google Scholar
  31. 31.
    Sheng, C., Tao, Y.: FIFO indexes for decomposable problems. In: Proceedings of the 30th ACM Symposium on Principles of Database Systems (PODS), pp. 25–35 (2011)Google Scholar
  32. 32.
    Zhou, G.: Two-dimensional range successor in optimal time and almost linear space. Inf. Process. Lett. 116(2), 171–174 (2016)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  2. 2.Mentor Graphics Corp.WilsonvilleUSA

Personalised recommendations