# B. Chazelle

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Shape distributions

- R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin
- Computer Science, Mathematics
- TOGS
- 1 October 2002

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 of… Expand

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

- Nir Ailon, B. Chazelle
- Computer Science
- STOC '06
- 21 May 2006

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 faster… Expand

Matching 3D models with shape distributions

- R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin
- Mathematics, Computer Science
- Proceedings International Conference on Shape…
- 7 May 2001

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 of… Expand

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 with… Expand

The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors

- Nir Ailon, B. Chazelle
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 May 2009

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 random… Expand

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 the… Expand

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 each… Expand

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. We… Expand

The Bloomier filter: an efficient data structure for static support lookup tables

- B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal
- Computer Science
- SODA '04
- 11 January 2004

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 classical… Expand

The discrepancy method - randomness and complexity

- B. Chazelle
- Computer Science, Mathematics
- 24 July 2000

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 mixing… Expand