1. Cgal, Computational Geometry Algorithms Library, http://www.cgal.org
2. Arroyuelo, D., Claude, F., Dorrigiv, R., Durocher, S., He, M., López-Ortiz, A., Munro, J.I., Nicholson, P.K., Salinger, A., Skala, M.: Untangled monotonic chains and adaptive range search, http://www.recoded.cl/docs/untangling.pdf
3. Arroyuelo, D., Claude, F., Dorrigiv, R., Durocher, S., He, M., López-Ortiz, A., Munro, J.I., Nicholson, P.K., Salinger, A., Skala, M.: Untangled monotonic chains and adaptive range search. In: 20th International Symposium on Algorithms and Computation (ISAAC), pp. 203–212 (2009)
4. Bar Yehuda, R., Fogel, S.: Partitioning a sequence into few monotone subsequences. Acta Informatica 35(5), 421–440 (1998)
5. Barbay, J., López-Ortiz, A., Lu, T., Salinger, A.: An experimental investigation of set intersection algorithms for text searching. J. Exp. Algorithmics 14 ,3.7–3.24 (2009)