• Publications
  • Influence
Shape distributions
Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer graphics, computer vision, molecular biology, and a variety of other fields. A challenging aspect ofExpand
  • 1,579
  • 90
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of l<sub>2</sub><sup>d</sup> into l<sub>p</sub><sup>O(log n)</sup> (p=1,2), called the <i>Fast-Johnson-Linden-strauss-Transform</i>. The FJLT is fasterExpand
  • 406
  • 55
Matching 3D models with shape distributions
Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer vision, molecular biology, computer graphics, and a variety of other fields. A challenging aspect ofExpand
  • 653
  • 54
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
  • B. Chazelle
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 June 1988
We establish new upper bounds on the complexity of multidimensional searching. Our results include, in particular, linear-size data structures for range and rectangle counting in two dimensions withExpand
  • 335
  • 44
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors
We introduce a new low-distortion embedding of $\ell_2^d$ into $\ell_p^{O(\log n)}$ ($p=1,2$) called the fast Johnson-Lindenstrauss transform (FJLT). The FJLT is faster than standard randomExpand
  • 328
  • 39
Triangulating a simple polygon in linear time
  • B. Chazelle
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1 December 1991
We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic strategy is to build a coarse approximation of a triangulation in a bottom-up phase and then use theExpand
  • 698
  • 36
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
  • B. Chazelle
  • Computer Science
  • IEEE Transactions on Computers
  • 1 August 1983
We study implementations of the bottom-left heuristic for two-dimensional bin-packing. To pack N rectangles into an infinite vertical strip of fixed width, the strategy considered here places eachExpand
  • 259
  • 35
Cutting hyperplanes for divide-and-conquer
  • B. Chazelle
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1 February 1993
Givenn hyperplanes inEd, a (1/r)-cutting is a collection of simplices with disjoint interiors, which together coverEd and such that the interior of each simplex intersects at mostn/r hyperplanes. WeExpand
  • 265
  • 34
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction generalizes the classicalExpand
  • 383
  • 30
The discrepancy method - randomness and complexity
This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixingExpand
  • 399
  • 28