Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
暂无分享,去创建一个
[1] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[2] H. Davenport. A combinatorial problem connected with differential equations II , 1971 .
[3] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4] Mikhail J. Atallah,et al. Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.
[6] Micha Sharir,et al. Retraction: A new approach to motion-planning , 1983, STOC.
[7] Micha Sharir,et al. Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..
[8] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..
[9] E. Szemerédi. On a problem of Davenport and Schinzel , 1974 .
[10] H. Davenport,et al. A Combinatorial Problem Connected with Differential Equations , 1965 .
[11] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[12] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[13] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.