1. Lecture Notes in Computer Science;PK Agarwal,2014
2. Agarwal, P.K., Cheng, S.-W., Yi, K.: Range searching on uncertain data. ACM Trans. Algorithms (TALG) 8(4), 43 (2012)
3. Atallah, M.J., Qi, Y., Yuan, H.: Asymptotically efficient algorithms for skyline probabilities of uncertain data. ACM Trans. Datab. Syst. 32(2), 12 (2011)
4. Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: nearest neighbor relations for imprecise points. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 410–419 (2004)
5. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Cambridge Philos. Soc. 55, 299–327 (1959)