A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
暂无分享,去创建一个
[1] Mark de Berg,et al. On lazy randomized incremental construction , 1994, STOC '94.
[2] Micha Sharir,et al. Almost tight upper bounds for the single cell and zone problems in three dimensions , 1994, SCG '94.
[3] Micha Sharir,et al. On the Two-Dimensional Davenport Schinzel Problem , 2018, J. Symb. Comput..
[4] Jirí Matousek,et al. Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.
[5] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[6] 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..
[7] Micha Sharir,et al. Castles in the air revisited , 1992, SCG '92.
[8] Micha Sharir,et al. Triangles in space or building (and analyzing) castles in the air , 1990, Comb..
[9] Sivan Toledo,et al. On critical orientations in the kedem-sharir motion planning algorithm , 1997, CCCG.
[10] Micha Sharir,et al. Arrangements and their applications in robotics: recent developments , 1995 .
[11] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[12] Micha Sharir,et al. An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space , 1990, Discret. Comput. Geom..
[13] Leonidas J. Guibas,et al. Combinatorics and Algorithms of Arrangements , 1993 .
[14] Klara Kedem,et al. A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..
[15] Sivan Toledo,et al. Extremal polygon containment problems , 1991, SCG '91.
[16] Robert E. Tarjan,et al. Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.