Jon Bentley

From Wikipedia, the free encyclopedia
For the British TV presenter, see Jon Bentley (TV presenter).
Jon Louis Bentley
Born (1953-02-20) February 20, 1953
Long Beach, California
Residence United StatesUnited States
Alma mater University of North Carolina at Chapel Hill
Occupation Computer Scientist
Employer Avaya
Title Research Scientist

Jon Louis Bentley (born February 20, 1953 in Long Beach, California)[1] is a researcher in the field of computer science. He is credited with the invention of the k-d tree.

Bentley received a B.S. in mathematical sciences from Stanford University in 1974, and M.S. and Ph.D in 1976 from the University of North Carolina at Chapel Hill; while a student, he also held internships at the Xerox Palo Alto Research Center and Stanford Linear Accelerator Center.[1] After receiving his Ph.D., he joined the faculty at Carnegie Mellon University as an assistant professor of computer science and mathematics.[1] At CMU, his students included Brian Reid, John Ousterhout, Jeff Eppinger, Joshua Bloch, and James Gosling, and he was one of Charles Leiserson's advisors. Later, Bentley moved to Bell Laboratories.

He found an optimal solution for the two dimensional case of Klee's measure problem: given a set of n rectangles, find the area of their union. He and Thomas Ottmann invented the Bentley–Ottmann algorithm, an efficient algorithm for finding all intersecting pairs among a collection of line segments. He wrote the Programming Pearls column for the Communications of the ACM magazine, and later collected the articles into two books of the same name. He has published or presented over 200 papers.

Bentley received the Dr. Dobb's Excellence in Programming award in 2004.

Bibliography

Notes

  1. ↑ 1.0 1.1 1.2 Biography from Bentley, J. L.; Ottmann, T. A. (1979), "Algorithms for reporting and counting geometric intersections", IEEE Transactions on Computers C–28 (9): 643–647, doi:10.1109/TC.1979.1675432 .

References

Authority control
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.