Author:
Maheshwari Anil,Nouri Arash,Sack Jörg-Rüdiger
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference25 articles.
1. Agarwal PK, Arge L, Yi K (2005) An optimal dynamic interval stabbing-max data structure? In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA ’05. Society for Industrial and Applied Mathematics, Philadelphia, pp 803–812.
http://dl.acm.org/citation.cfm?id=1070432.1070546
2. Agarwal PK, Kumar N, Sintos S, Suri S (2018) Computing shortest paths in the plane with removable obstacles. In: SWAT 2018, pp 5:1–5:15
3. Asano T, Asano T, Guibas L, Hershberger J, Imai H (1986) Visibility of disjoint polygons. Algorithmica 1(1):49–63.
https://doi.org/10.1007/BF01840436
4. Berg Md, Cheong O, Mv Kreveld, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Santa Clara
5. Chazelle B (1988) Functional approach to data structures and its use in multidimensional searching. SIAM J Comput 17(3):427–462.
https://doi.org/10.1137/0217026
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献