`bibliography sjf`

S. J. Fortune and J. Wyllie, Parallelism in Random Access Machines, Tenth Annual Symposium on Theory of Computing, pp. 114--118, 1978.
S. J. Fortune and J. Hopcroft and E. Schmidt, The Complexity of Equivalence and Containment for Free Single Variable Program Schemes, Automata Languages and Programming, Vol. 62, pp. 227--240, Springer-Verlag Lecture Notes in Computer Science, 1978.
S. J. Fortune and J. Hopcroft, A Note on Rabin s Nearest Neighbor Algorithm, Information Processing Letters, Vol. 8, pp. 20--23, 1979.
S. J. Fortune and J. Hopcroft and J. Wyllie, The Directed Subgraph Homeomorphism Problem, Theoretical Computer Science, Vol. 10, pp. 11--121, 1980.
S. J. Fortune and Ashok Chandra and Richard Lipton, Lower Bounds for Constant Depth Circuits for Prefix Problems, Proc. 10th Coll. on Automata Languages and Programming, pp. 109--117, Springer Verlag Lecture Notes in Computer Science 154, 1983.
S. J. Fortune and Michael O Donnell and Daniel Leivant, The Expressiveness of Simple and Second-Order Type Structures, JACM, Vol. 30, pp. 151--185, 1983.
S. J. Fortune, A Note on Sparse Complete Sets, SIAM Journal on Computing, 1979.
S. J. Fortune and M. Merritt, Poker Protocols, Crypto 84, 1984.
S. J. Fortune and B. Baker and S. Mahaney, Polygon Containment under Translation, J. of Algorithms, Vol. 37, pp. 532--548, 1986.
S. J. Fortune and A. Chandra and D. Lipton, Unbounded Fan-in Circuits and Associative Functions, Journal of Computer and System Sciences, Vol. 30, pp. 222--234, 1985.
B. S. Baker and S. J. Fortune and E. Grosse, Stable Prehension With Three Fingers, Proc. 17th Annual ACM Symposium on Theory of Computing, pp. 114--120, Providence RI, 1985.
B. S. Baker and S. J. Fortune and E. H. Grosse, Stable Grasps With a Multi-Fingered Hand, Proc. IEEE Conf. on Robotics and Automation, pp. 570--575, St. Louis MO, 1985.
S. J. Fortune, A Fast Algorithm for Polygon Containment by Translation, Proc. 12th Coll. on Automata Languages and Programming, pp. 189--190, Springer-Verlag Lecture Notes in Computer Science 194, 1985.
S. J. Fortune and G. Wilfong and C. Yap, Coordinated Motion of Two Robot Arms, Proc. IEEE Conf. on Robotics and Automation, 1986.
S. J. Fortune, A Sweepline Algorithm for Voronoi Diagrams, Algorithmica, pp. 153--174, 1987.
S. J. Fortune and G. Wilfong, Planning Constrained Motion, Annals of Mathematics and Artificial Intelligence, Vol. 3, pp. 21--82, 1991.
S. J. Fortune and G. Wilfong and B. Aronov, The Furthest Site Geodesic Voronoi Diagram, Discrete and Computational Geometry, Vol. 9, pp. 217--255, 1993.
S. J. Fortune and G. Wilfong and B. Aronov, Minimum Speed Motions, International J. of Robotics Research, Vol. 10, pp. 228--239, 1991.
S. J. Fortune, Stable Maintenance of Point-Set Triangulations in Two Dimensions, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 494--499, 1989.
H. S. Baird and S. E. Jones and S. J. Fortune, Image Segmentation by Shape-Guided Covers, 10th International Conference on Pattern Recognition, 1990.
S. J. Fortune and V. Milenkovic, Numerical Stability of Algorithms for Line Arrangments, Proc. Seventh Annual Symposium on Computational Geometry, pp. 334--341, 1991.
S. J. Fortune, Voronoi Diagrams and Delaunay Triangulations, Euclidean Geometry and Computers, pp. 193--233, 1992, (World Scientific Publishing Co. D.A. Du F.K. Hwang eds.) .
S. J. Fortune, Progress in Computational Geometry, Directions in Geometric Computing, pp. 81--128, 1993, (Information Geometers R. Martin ed.) .
S. J. Fortune, Numerical Stability of Algorithms for 2D Delaunay triangulations, International Journal of Computational Geometry and Applications, Vol. 5, pp. 193--213, 1995.
S. J. Fortune and C. Van Wyk, Efficient Exact Arithmetic for Computational Geometry, Proc. Ninth Annual Symposium on Computational Geometry, pp. 163--172, 1993.
S. J. Fortune, A Note on Delaunay Diagonal Flips, Pattern Recognition Letters, Vol. 14, pp. 723--726, 1993.
S.J. Fortune and D. Gay and B. Kernighan and O. Landron and R. Valenzuela and M. Wright, WISE Design of Indoor Wireless Systems, IEEE Computational Science and Engineering, pp. 58--68, 1995.
S.J. Fortune and C. Van Wyk, Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry, Transactions on Graphics, pp. 223--248, 1996.
S.J. Fortune, A beam-tracing algorithm for prediction of indoor radio propagation, Applied computational geometry: towards geometric engineering, pp. 157--166, Springer, 1996.
S.J. Fortune, Robustness issues in geometric algorithms, Applied computational geometry: towards geometric engineering, pp. 9--14, Springer, 1996.
B. Aronov and S.J. Fortune, Average-case ray shooting and minimum weight triangulations, Proc. Thirteenth Annual Symposium on Computational Geometry, pp. 203--211, 1997.
S.J. Fortune, Polyhedral modelling with multiprecision integer arithmetic, Computer-Aided Design, Vol. 29, pp. 123--133, 1997.
V. Erceg and S.J. Fortune and J. Ling and A. Rustako and R. Valenzuela, Comparisons of a computer-based propagation prediction tool with experimental data collected in urban microcellular environments, IEEE Journal on selected areas in communications, Vol. 15, pp. 677--684, 1997.
S.J. Fortune, Voronoi diagrams and Delaunay triangulations, CRC Handbook of Discrete and Computational Geometry, pp. 377--388, 1997.
S.J. Fortune, Vertex-rounding a three-dimensional polyhedral subdivision, Proc. Fourteenth Annual Symposium on Computational Geometry, pp. 116--125, 1998.
S.C. Kim and B. Guarino and T. Willis and V. Erceg and S. Fortune and R. Valenzuela and L. Thomas and J. Ling and J. Moore, Radio propagation measurements and prediction using thee-dimensional ray tracing in urban environments at 908 Mhz and 1.9Ghz, IEEE Transactions on vehicular technology, Vol. 48, pp. 931--946, 1999.
S.J. Fortune, Topological beam tracing, Proc. Fifteenth Annual Symposium on Computational Geometry, pp. 59--68, 1999.
B. Aronov and S.J. Fortune, Approximating minimum-weight triangulations in three dimensions, Discrete and Computational Geometry, to appear.