1. Asano T, Asano T, Guibas LJ, Hershberger J, Imai H (1986) Visibility of disjoint polygons. Algorithmica 1:49–63
2. Canny J, Reif JH (1987) New lower bound techniques for robot motion planning problems. In: Proceedings of the 28th annual IEEE symposium on foundations of computer Science, Washington, DC, pp 49–60
3. Chazelle B, Sharir M, Welzl E (1992) Quasi-optimal upper bounds for simplex range searching and new zone theorems. Algorithmica 8:407–429
4. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge
5. Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1989) Making data structures persistent. J Comput Syst Sci 38:86–124