Window Queries for Problems on Intersecting Objects and Maximal Points*-Reference-Cited by-同舟云学术

Window Queries for Problems on Intersecting Objects and Maximal Points*

Published:2018 Issue: Volume: Page:199-213
ISSN:0302-9743
Container-title:Algorithms and Discrete Applied Mathematics
language:
Short-container-title:

Author:

Chanchary Farah,Maheshwari Anil,Smid Michiel

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-74180-2_17

Reference12 articles.

1. 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) (2014)

2. Bannister, M.J., DuBois, C., Eppstein, D., Smyth, P.: Windows into relational events: data structures for contiguous subsequences of edges. In: Proceedings of the 24th ACM-SIAM SODA, pp. 856–864. SIAM (2013)

3. Bokal, D., Cabello, S., Eppstein, D.: Finding all maximal subsequences with hereditary properties. In: 31st International Symposium on Computational Geometry, SoCG 2015, pp. 240–254 (2015)

4. Chan, T.M.: Optimal partition trees. Discrete Comput. Geom. 47(4), 661–690 (2012)

5. Chan, T.M., Pratt, S.: Two approaches to building time-windowed geometric data structures. In: 32nd International Symposium on Computational Geometry, SoCG 2016, pp. 28:1–28:15 (2016)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Window queries for intersecting objects, maximal points and approximations using coresets;Discrete Applied Mathematics;2021-12

2. A Time-Windowed Data Structure for Spatial Density Maps;Proceedings of the 28th International Conference on Advances in Geographic Information Systems;2020-11-03

3. The Most Likely Object to be Seen Through a Window;International Journal of Computational Geometry & Applications;2019-12-01