Reaching a Goal with Directional Uncertainty

[1]  Micha Sharir,et al.  Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..

[2]  Marc J. van Kreveld On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract) , 1993, WADS.

[3]  Dj Paddon,et al.  Third Eurographics Workshop on Rendering , 1992 .

[4]  P. Heckbert Simulating Global Illumination Using Adaptive Meshing , 1991 .

[5]  J. Winget,et al.  Finite Element Methods for Global Illumination , 1991 .

[6]  John Hershberger,et al.  Input-Sensitive Compliant Motion in the Plane , 1990, SWAT.

[7]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[8]  Amy J. Briggs An efficient algorithm for one-step planar complaint motion planning with uncertainty , 1989, SCG '89.

[9]  David G. Kirkpatrick,et al.  Determining sector visibility of a polygon , 1989, SCG '89.

[10]  J. Hershberger,et al.  Compliant motion in a simple polygon , 1989, SCG '89.

[11]  Bruce Randall Donald,et al.  The complexity of planar compliant motion planning under uncertainty , 1988, SCG '88.

[12]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[13]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[14]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).