Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference19 articles.
1. M. Atallah, Dynamic computational geometry,Proc. 24th Symp. on Foundations of Computer Science, 1983, pp. 92–99.
2. B. K. Bhattacharya and J. Zorbas, Solving the two-dimensional findpath problem using a line-triangle representation of the robot. Tech. Rept., School of Computing Science, Simon Fraser University, Burnaby, B.C. V5A 1S6.
3. L. Guibas, L. Ramshaw, and J. Stolfi, A kinetic framework for computational geometry,Proc. 24th IEEE Symp. on Foundations of Computer Science, 1983, pp. 100–111.
4. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes,Combinatorica 6(2) (1986), 151–177.
5. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion admist polygonal obstacles,Discrete Comput. Geom. 1 (1986), 59–71.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献