A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion
暂无分享,去创建一个
[1] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.
[2] D. T. Lee,et al. Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..
[3] Richard Cole,et al. Geometric applications of Davenport-Schinzel sequences , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[4] Micha Sharir,et al. Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..
[5] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..
[6] M. Atallah. Some dynamic computational geometry problems , 1985 .
[7] Leonidas J. Guibas,et al. On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.
[8] Micha Sharir,et al. An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space , 1990, Discret. Comput. Geom..
[9] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[10] Sivan Toledo,et al. Extremal polygon containment problems , 1991, SCG '91.
[11] Klara Kedem,et al. Placing the largest similar copy of a convex polygon among polygonal obstacles , 1989, SCG '89.
[12] Micha Sharir,et al. On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space , 1987, Discret. Comput. Geom..
[13] Jean-Daniel Boissonnat,et al. Polygon Placement Under Translation and Rotation , 1988, RAIRO Theor. Informatics Appl..
[14] Robert L. Scot Drysdale,et al. Voronoi diagrams based on convex distance functions , 1985, SCG '85.
[15] Micha Sharir,et al. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.
[16] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.
[17] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[18] John Canny,et al. The complexity of robot motion planning , 1988 .