1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, New York (1999)
2. Bhowmick, P., Pal, O., Klette, R.: A linear-time algorithm for the generation of random digital curves. In: Proc. PSIVT, pp. 168–173. IEEE Comput. Soc., Los Alamitos (2010)
3. Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. IEEE Conf. Foundations Computer Science, pp. 49–60 (1987)
4. Choi, J., Sellen, J., Yap, C.-K.: Approximate Euclidean shortest path in 3-space. In: Proc. ACM Conf. Computational Geometry, pp. 41–48 (1994)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)