Author:
Bose Prosenjit,Tuttle Tyler
Publisher
Springer International Publishing
Reference25 articles.
1. Aluru, S.: Quadtrees and octrees. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications, chapter 19, 1 edn, pp. 1–26. Chapman and Hall/CRC (2004). https://doi.org/10.1201/9781420035179. ISBN 1-58488-435-5
2. Arya, S., Mount, D.M., Smid, M.: Randomized and deterministic algorithms for geometric spanners of small diameter. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 703–712 (1994). https://doi.org/10.1109/SFCS.1994.365722. ISBN 0-8186-6580-7
3. Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin and lanky. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 489–498 (1995). https://doi.org/10.1145/225058.225191. ISBN 978-0-89791-718-6
4. Baharifard, F., Farhadi, M., Zarrabi-Zadeh, H.: Routing in well-separated pair decomposition spanners. In: Proceedings of the 1st Iranian Conference on Computational Geometry, pp. 25–28 (2018)
5. Bonichon, N., Bose, P., De Carufel, J.L., Perković, L., Van Renssen, A.: Upper and lower bounds for online routing on delaunay triangulations. Discrete Comput. Geom. 58(2), 482–504 (2017). https://doi.org/10.1137/110832458