Author:
Abellanas Manuel,Bereg Sergey,Hurtado Ferran,Olaverri Alfredo García,Rappaport David,Tejel Javier
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference13 articles.
1. I. Balaban, An optimal algorithm for finding segment intersections, in: Proc. 11 Annu. ACM Sympos. Comput. Geom., 1995, pp. 211–219
2. Efficient algorithms for line and curve segment intersection using restricted predicates;Boissonnat;Computational Geometry,2000
3. S.J. Buckley, Fast motion planning for multiple moving robots, in: Proc. of IEEE Int. Conf. on Robot's and Automation, 1989, pp. 322–326
4. Sliding coin puzzles;Demaine,2002
5. A packing problem with applications to lettering of maps;Formann,1991
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献