AN IMPROVED ALGORITHM FOR THE FIXED-RADIUS NEIGHBOR PROBLEMCHAZELLE B.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 193-198; BIBL. 12 REF.Article

A functional approach to data structures and its use in multidimensional searchingCHAZELLE, B.SIAM journal on computing (Print). 1988, Vol 17, Num 3, pp 427-462, issn 0097-5397Article

The bottom-left bin-packing heuristic: an efficient implementationCHAZELLE, B.IEEE transactions on computers. 1983, Vol 32, Num 8, pp 697-707, issn 0018-9340Article

DETECTION IS EASIER THAN COMPUTATIONCHAZELLE B; DOBKIN DP.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 146-153; BIBL. 8 REF.Conference Paper

A spectral approach to lower bounds with applications to geometric searchingCHAZELLE, B.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 545-556, issn 0097-5397Article

Filtering search: a new approach to guery-answeringCHAZELLE, B.SIAM journal on computing (Print). 1986, Vol 15, Num 3, pp 703-724, issn 0097-5397Article

How to search in historyCHAZELLE, B.Information and control. 1985, Vol 64, Num 1-3, pp 77-99, issn 0019-9958Article

Lower bounds for orthogonal range searching. II, The arithmetic modelCHAZELLE, B.Journal of the Association for Computing Machinery. 1990, Vol 37, Num 3, pp 439-463, issn 0004-5411, 25 p.Article

Some techniques for geometric searching with implicit set representationsCHAZELLE, B.Acta informatica. 1987, Vol 24, Num 5, pp 565-582, issn 0001-5903Article

A MODEL OF COMPUTATION FOR VLSI WITH RELATED COMPLEXITY RESULTSCHAZELLE B; MONIER L.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 318-325; BIBL. 14 REF.Conference Paper

Convex partitions of polyhedra: a lower bound and worst-case optimal algorithmCHAZELLE, B.SIAM journal on computing (Print). 1984, Vol 13, Num 3, pp 488-507, issn 0097-5397Article

On linear-time deterministic algorithms for optimization problems in fixed dimensionCHAZELLE, B; MATOUSEK, J.Journal of algorithms (Print). 1996, Vol 21, Num 3, pp 579-597, issn 0196-6774Article

Intersection of convex objects in two and three dimensionsCHAZELLE, B; DOBKIN, D. P.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 1, pp 1-27, issn 0004-5411Article

Decomposing the boundary of a nonconvex polyhedronCHAZELLE, B; PALIOS, L.Algorithmica. 1997, Vol 17, Num 3, pp 245-265, issn 0178-4617Article

An optimal algorithm for intersecting line segments in the planeCHAZELLE, B; EDELSBRUNNER, H.Journal of the Association for Computing Machinery. 1992, Vol 39, Num 1, pp 1-54, issn 0004-5411Article

A deterministic view of random sampling and its use in geometryCHAZELLE, B; FRIEDMAN, J.Combinatorica (Print). 1990, Vol 10, Num 3, pp 229-249, issn 0209-9683Article

An improved algorithm for constructing Kth-order Voronoi diagramsCHAZELLE, B; EDELSBRUNNER, H.IEEE transactions on computers. 1987, Vol 36, Num 11, pp 1349-1354, issn 0018-9340Article

Product range spaces, sensitive sampling, and derandomizationBRÖNNIMANN, H; CHAZELLE, B; MATOUSEK, J et al.SIAM journal on computing (Print). 1999, Vol 28, Num 5, pp 1552-1575, issn 0097-5397Article

The power of geometric dualityCHAZELLE, B; GUIBAS, L. J; LEE, D. T et al.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 76-90, issn 0006-3835Article

On a circle placement problemCHAZELLE, B. M; LEE, D. T. K.Computing (Wien. Print). 1986, Vol 36, Num 1-2, pp 1-16, issn 0010-485XArticle

New upper bounds for neighbor searchingCHAZELLE, B; COLE, R; PREPARATA, F. P et al.Information and control. 1986, Vol 68, Num 1-3, pp 105-124, issn 0019-9958Article

Computing a face in an arrangement of line segments and related problemsCHAZELLE, B; EDELSBRUNNER, H; GUIBAS, L et al.SIAM journal on computing (Print). 1993, Vol 22, Num 6, pp 1286-1302, issn 0097-5397Article

A singly exponential stratification scheme for real semi-algebraic varieties and its applicationsCHAZELLE, B; EDELSBRUNNER, H; GUIBAS, L. J et al.Theoretical computer science. 1991, Vol 84, Num 1, pp 77-105, issn 0304-3975, 29 p.Conference Paper

Selecting heavily covered pointsCHAZELLE, B; EDELSBRUNNER, H; GUIBAS, L. J et al.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1138-1151, issn 0097-5397Article

Splitting a Delaunay triangulation in linear timeCHAZELLE, B; DEVILLERS, O; HURTADO, F et al.Algorithmica. 2002, Vol 34, Num 1, pp 39-46, issn 0178-4617Article