13.21.3 H.3. Visibility, Path Planning, etc.

Chapter Contents (Back)

Atallah, M.J.,
A Matching Problem In The Plane,
JCSS(31), 1985, pp. 63-70. BibRef

Sedgewick, R., Vitter, J.S.,
Shortest Paths In Euclidean Graphs,
ALGORITHMICA(1), 1986, pp. 31-48. BibRef

Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.,
Visibility Of Disjoint Polygons,
ALGORITHMICA(1), 1986, pp. 49-63. BibRef

Ntafos, S.,
On Gallery Watchmen In Grids,
IPL(23), 1986, pp. 99-102. BibRef

Sharir, M., Schorr, A.,
On Shortest Paths In Polyhedral Spaces,
SIAM JC(15), 1986, pp. 193-215. BibRef

Lee, D.T., Lin, A.K.,
Computational Complexity Of Art Gallery Problems,
T-IT(32), 1986, pp. 276-282. BibRef

Lee, D.T., Lin, A.K.,
Computing The Visibility Polygon From An Edge,
CVGIP(34), 1986, pp. 1-19. BibRef

Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.,
Linear Time Algorithms For Visibility And Shortest Path Problems Inside Simple Polygons,
CG(86), pp. 1-13. BibRef

Suri, S., O'Rourke, J.,
Worst-Case Optimal Algorithms For Constructing Visibility Polygons With Holes,
CG(86), pp. 14-23. BibRef

Chin, W.P., Ntafos, S.,
Optimum Watchman Routes,
CG(86), pp. 24-33. BibRef

Rappaport, D., Imai, H., Toussaint, G.T.,
On Computing Simple Circuits On A Set Of Line Segments,
CG(86), pp. 52-60. BibRef

Suri, S.,
A Linear Time Algorithm For Minimum Link Paths Inside A Simple Polygon,
CVGIP(35), 1986, pp. 99-110. BibRef

Toussaint, G.T.,
Shortest Path Solves Edge-To-Edge Visibility In A Polygon,
PRL(4), 1986, pp. 165-170. BibRef

Plantinga, W.H., Dyer, C.R.,
An Algorithm For Constructing The Aspect Graph,
SFCS(86), pp. 123-131. BibRef

Lodi, E., Pagli, L.,
A Vlsi Solution To The Vertical Segment Visibility Problem,
T-COMP(35), 1986, pp. 923-928. BibRef

Harnett, R.M., Kiel, G.C.,
Optimal Taxiway Repair: A Set-Covering Approach,
JCIS(14), 1985, pp. 405-419. BibRef

Falkowski, B.J., Schmitz, L.,
A Note On The Queens' Problem,
IPL(23), 1986, pp. 39-46. BibRef

Kedem, K., Livne, R., Pach, J., Sharir, M.,
On The Union Of Jordan Regions And Collision-Free Translational Motion Amidst Polygonal Obstacles,
DCG(1), 1986, pp. 59-71. BibRef

Rohnert, H.,
Shortest Paths In The Plane With Convex Polygonal Obstacles,
IPL(23), 1986, pp. 71-76. BibRef

Sifrony, S., Sharir, M.,
A New Efficient Motion-Planning Algorithm For A Rod In Polygonal Space,
CG(86), pp. 178-186. BibRef

Maddila, S.R., Yap, C.K.,
Moving A Polygon Around The Corner In A Corridor,
CG(86), pp. 187-192. BibRef

Hopcroft, J.E., Wilfong, G.T.,
Reducing Multiple Object Motion Planning To Graph Searching,
SIAM JC(15), 1986, pp. 768-785. BibRef

Nurmi, O.,
On Translating A Set Of Objects In 2- And 3-Dimensional Space,
CVGIP(36), 1986, pp. 42-52. BibRef

Sharir, M., Cole, R., Kedem, K., Leven, D., Pollack, R., Sifrony, S.,
Geometric Applications Of Davenport-Schinzel Sequences,
SFCS(86), pp. 77-86. BibRef

Chapter on Rosenfeld Bibliography for 1986 continues in
H.4. Search, Intersection, etc. .

Last update:Jun 7, 2018 at 10:14:50