Author:
Barequet Gill,Dickerson Matthew T.,Scharf Yuval
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference15 articles.
1. I.J. Balaban, An optimal algorithm for finding segments intersections, in: Proc. 11th Ann. ACM Symp. on Computational Geometry, Vancouver, British Columbia, Canada, 1995, pp. 211–219
2. Optimizing a constrained convex polygonal annulus;Barequet;Journal of Discrete Algorithms,2005
3. Offset-polygon annulus placement problems;Barequet;Computational Geometry: Theory and Applications,1998
4. G. Barequet, M.T. Dickerson, The translation–scale diagram for point-containing placements of a convex polygon, in: Proc. 12th Canadian Conf. on Computational Geometry, Fredericton, New Brunswick, Canada, 2000, pp. 7–12
5. Translating a convex polygon to contain a maximum number of points;Barequet;Computational Geometry: Theory and Applications,1997
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献