Author:
Maheshwari Anil,Nussbaum Doron,Sack Jörg-Rüdiger,Yi Jiehua
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Berkman, O., Schieber, B., Vishkin, U.: Some doubly logarithmic optimal parallel algorithm based on finding all nearest smaller values. Technical Report, University of Maryland, UMIACS-TR-88-79 (1988)
2. Chang, E.C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K.: Shortest path amidst disc obstacles is computable. In: Proc. of the 21st annual Symposium on Computational Geometry (SoCG), pp. 116–125 (2005)
3. Jin, L., Kim, D., Mu, L., Kim, D-S., Hu, S.-M.: A sweepline algorithm for Euclidean Voronoi diagram of circles. Computer-Aided Design 38, 260–272 (2006)
4. Lecture Notes in Computer Science;D.S. Kim,2004
5. Mitchell, J.S.B: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier, Amsterdam (2000)