Author:
Durocher Stephane,Keil J. Mark,Mehrabi Saeed,Mondal Debajyoti
Publisher
Springer International Publishing
Reference23 articles.
1. Arkin, E.M., et al.: On the reflexivity of point sets. Discret. Comput. Geom. 25, 139–156 (2003)
2. Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proceedings of the Symposium on Computational Geometry (SoCG), pp. 161–167 (1985)
3. Brodén, B., Hammar, M., Nilsson, B.J.: Guarding lines and 2-link polygons is APX-hard. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 45–48 (2001)
4. Chvátal, V., Klincsek, G.: Finding largest convex subsets. Congr. Numer. 29, 453–460 (1980)
5. Lecture Notes in Computer Science;R Ding,2003
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set;International Journal of Computational Geometry & Applications;2023-02-01