Computer scientist who invented the dimensional k-d tree, which is a space-partitioning data structure for organizing points in a k-dimensional space.
He attended Stanford University, where he earned a B.S. in mathematical sciences, and the University of North Carolina at Chapel Hill, where he earned his M.S. and Ph.D.
He devised an optimal solution for Klee's measure problem and also co-invented the Bentley-Ottmann algorithm.
His family was living in Long Beach, California, when he was born.
He was employed at the Alexander Graham Bell Laboratories, following a stint as assistant professor of computer science and mathematics at Carnegie Mellon University.