Ramos, Edgar A. Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Ramos, E. A., Amato, N. M., & Goodrich, M. T. (2000). Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In N. M. Amato, & M. T. Goodrich (Eds.), Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00) (pp. 705-706). New York, USA: ACM Press.
