Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Pankaj K. Agarwal and Micha Sharir (1998). Efficient algorithms for geometric optimization. ACM Comput. Surv., vol. 30, pp. 412–458.
2. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf (2000). Computational Geometry: Algorithms and Applications (2nd ed.). Springer-Verlag.
3. K.L. Clarkson (1986). Linear Programming in O(n.23.d
2 ) time. Inform. Process. Lett., vol. 22, pp. 21–24.
4. K.L. Clarkson (1998). A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci., pp. 452–456.
5. I. Debled-Rennesson, J.-P. Reveillès (1995). A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence, vol. 9, no. 6, pp. 635–662.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献