Author:
Agarwal Pankaj K.,Chen Danny Z.,Ganjugunte Shashidhara K.,Misiołek Ewa,Sharir Micha,Tang Kai
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Agarwal, P.K., Chen, D.Z., Ganjugunte, S.K., Misołek, E., Sharir, M., Tang, K.: Stabbing convex polygons with a segment or a polygon (2008),
http://www.cs.duke.edu/~shashigk/sstab/shortstab.pdf
2. Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49–119. Elsevier, Amsterdam (2000)
3. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proc. of the 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 886–894 (2005)
4. Berman, P., DasGupta, B.: Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17, 331–356 (1997)
5. Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37, 43–58 (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献