Jon Bentley (computer scientist)

from Wikipedia, the free encyclopedia

Jon Louis Bentley (born February 20, 1953 in Long Beach, California ) is an American computer scientist. He is best known for developing several algorithms and books on algorithms that arose from his Programming Pearls column in Communications of the ACM .

Bentley studied mathematics at Stanford University with a bachelor's degree in 1974, received his master's degree in 1976 from the University of North Carolina at Chapel Hill , where he received his doctorate in 1976 under Donald Stanat (Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space). In the early 1980s he was an assistant professor at Carnegie Mellon University and later at Bell Laboratories .

The kd tree comes from Bentley . In 1979, together with Thomas Ottmann, he developed an algorithm for determining the intersection points of a set of line segments. In 1977 he found an algorithm for the two-dimensional generalization of Victor Klee's measurement problem (find the area of ​​a set of n rectangles, Klee asked the question for a set of n line segments and both found algorithms with running time of the order of magnitude ). In 1999 he found Douglas McIlroy the VCDIFF algorithm.

In 2004 he received the Excellence in Programming Award from Dr. Dobbs .

Fonts

Web links

Individual evidence

  1. ^ Biographical information in the article by Bentley, Ottmann, IEEE Trans. Comp. 1979.
  2. Jon Bentley in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  3. ^ Bentley, Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, C-28, 1979, pp. 643-647
  4. ^ Klee, American Mathematical Monthly, Volume 84, 1977, pp. 284-285
  5. ^ Bentley, Algorithms for Klee's rectangle problems, Report Carnegie Mellon University 1977