Author:
Bose Prosenjit,Morin Pat,Vigneron Antoine
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Farthest neighbors, maximum spanning trees, and related problems in higher dimensions;Agarwal;Computational Geometry,1992
2. The Voronoi diagram of curved objects;Alt,1995
3. Obnoxious facility location: Complete service with minimal harm;Ben-Moshe;Internat. J. Comput. Geom. Appl.,2000
4. Packing two disks in a polygon;Bespamyatnikh;Computational Geometry,2002
5. Hiding disks in folded polygons;Biedl,1998
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Circle and Sphere Packing;Introduction to Cutting and Packing Optimization;2017-10-24
2. Three problems about simple polygons;Computational Geometry;2006-10
3. Locating two obnoxious facilities using the weighted maximin criterion;Operations Research Letters;2006-01