Journal of the ACM Bibliography
James A. Storer and John H. Reif. Shortest paths in the
plane with polygonal obstacles. Journal of the ACM,
41(5):982-1012, September 1994.
[BibTeX entry]
Selected references
- Bernard Chazelle. A theorem on polygon
cutting with applications. In 23rd Annual Symposium on
Foundations of Computer Science, pages 339-349, Chicago,
Illinois, 3-5 November 1982. IEEE.
- Bernard Chazelle. Triangulating a simple
polygon in linear time. In 31st Annual Symposium on
Foundations of Computer Science, volume I, pages 220-230, St.
Louis, Missouri, 22-24 October 1990. IEEE.
- Kenneth L. Clarkson. Approximation algorithms
for shortest path motion planning (extended abstract). In
Proceedings of the Nineteenth Annual ACM Symposium on Theory of
Computing, pages 56-65, New York City, 25-27 May 1987.
- Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their
uses in improved network optimization algorithms. In 25th
Annual Symposium on Foundations of Computer Science, pages
338-346, Singer Island, Florida, 24-26 October 1984. IEEE.
- David G. Kirkpatrick. Efficient computation of
continuous skeletons. In 20th Annual Symposium on Foundations
of Computer Science, pages 18-27, San Juan, Puerto Rico, 29-31
October 1979. IEEE.
- Richard J. Lipton and Robert Endre Tarjan. Application of a planar
separator theorem. In 18th Annual Symposium on Foundations of
Computer Science, pages 162-170, Providence, Rhode Island, 31
October-2 November 1977. IEEE.
- Joseph S. B. Mitchell and Christos H. Papadimitriou. The weighted region problem:
Finding shortest paths through a weighted planar subdivision.
Journal of the ACM, 38(1):18-73, January 1991.
- Colm Ó'Dúnlaing, Micha Sharir, and Chee K. Yap. Retraction: A new
approach to motion-planning (extended abstract). In
Proceedings of the Fifteenth Annual ACM Symposium on Theory of
Computing, pages 207-220, Boston, Massachusetts, 25-27 April
1983.
- John H. Reif. Complexity of the mover's
problem and generalizations (extended abstract). In 20th
Annual Symposium on Foundations of Computer Science, pages
421-427, San Juan, Puerto Rico, 29-31 October 1979. IEEE.
- Robert Sedgewick and Jeffrey Scott Vitter. Shortest paths in
Euclidean graphs (extended abstract). In 25th Annual Symposium
on Foundations of Computer Science, pages 417-424, Singer Island,
Florida, 24-26 October 1984. IEEE.
- Michael Ian Shamos. Geometric complexity. In
Conference Record of Seventh Annual ACM Symposium on Theory of
Computation, pages 224-233, Albuquerque, New Mexico, 5-7 May
1975.
- Micha Sharir and Amir Schorr. On shortest paths in
polyhedral spaces. In Proceedings of the Sixteenth Annual ACM
Symposium on Theory of Computing, pages 144-153, Washington,
D.C., 1984.
Shortcuts: