Funder
Departament d’Innovació, Universitats i Empresa, Generalitat de Catalunya
MINECO
European Research Council
CONACYT
Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference15 articles.
1. Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl. 21(1–2), 39–61 (2002)
2. Agarwal, P.K., Hagerup, T., Ray, R., Sharir, M., Smid, M., Welzl, E.: Translating a planar object to maximize point containment. In: Algorithms — ESA 2002: 10th Annual European Symposium. Rome, Italy, September 17–21, 2002. Proceedings, pp. 42–53 (2002)
3. Baran, I., Demaine, E.D., Pǎtraṡcu, M.: Subquadratic algorithms for 3SUM. Algorithmica 50(4), 584–596 (2008)
4. Barequet, G., Dickerson, M., Pau, P.: Translating a convex polygon to contain a maximum number of points. Comput. Geom. Theory Appl. 8(4), 167–179 (1997)
5. Barequet, G., Goryachev, A.: Offset polygon and annulus placement problems. Comput. Geom. Theory Appl. 47(3, Part A), 407–434 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献