Steven Fortune

Bell Laboratories
Room 2C-518
600 Mountain Ave.
Murray Hill, NJ USA 07974-0636
(908) 582 7042 (office)
(908) 582 5857 (fax)
sjf @ bell-labs.com

I am Technical Manager of the Algorithms Research group within the Computing Systems Principles department of Bell Laboratories, Alcatel-Lucent. Our group performs fundamental research in theoretical computer science, particularly algorithms. We also engage in practical algorithmic work relevant to Alcatel-Lucent's technical problems.

Much of my past research has been in computational geometry, particularly robustness of geometric algorithms. For several years I worked on the WISE project, which uses geometric algorithms to predict radio propagation in indoor and outdoor environments. Other work includes a particularly efficient algorithm for approximating the roots of ill-conditioned, high-degree polynomials. More recent work includes the algorithmic innards of design tools for state-of-the-art optical networks.

Bibliography in bibtex format or html format. Recent Papers, most with links to gzipped postscript files.

I am associate editor of SIAM Journal on Computing and International Journal of Computational Geometry with Applications (and previously ACM Transactions on Graphics).

Software:

Voronoi: Very old, but fast and lightweight C program to compute 2d Voronoi diagrams and Delaunay triangulations. voronoi.tar (Others have fixed memory leaks and improved the code, for example Derek Bradley and Shane O'Sullivan). For more modern programs, see the CGAL web page or the Directory of Computational Geometry Software .
Eigensolve: Fast approximation of roots of a univariate polynomial.

Last modified: Oct 4, 2007.