AAAAAA

   
Results: 1-15 |
Results: 15
A SPECTRAL APPROACH TO LOWER BOUNDS WITH APPLICATIONS TO GEOMETRIC SEARCHING
Authors: CHAZELLE B
Citation: B. Chazelle, A SPECTRAL APPROACH TO LOWER BOUNDS WITH APPLICATIONS TO GEOMETRIC SEARCHING, SIAM journal on computing, 27(2), 1998, pp. 545-556
LOWER BOUNDS FOR OFF-LINE RANGE SEARCHING
Authors: CHAZELLE B
Citation: B. Chazelle, LOWER BOUNDS FOR OFF-LINE RANGE SEARCHING, Discrete & computational geometry, 17(1), 1997, pp. 53-65
DECOMPOSING THE BOUNDARY OF A NONCONVEX POLYHEDRON
Authors: CHAZELLE B PALIOS L
Citation: B. Chazelle et L. Palios, DECOMPOSING THE BOUNDARY OF A NONCONVEX POLYHEDRON, Algorithmica, 17(3), 1997, pp. 245-265
ON LINEAR-TIME DETERMINISTIC ALGORITHMS FOR OPTIMIZATION PROBLEMS IN FIXED DIMENSION
Authors: CHAZELLE B MATOUSEK J
Citation: B. Chazelle et J. Matousek, ON LINEAR-TIME DETERMINISTIC ALGORITHMS FOR OPTIMIZATION PROBLEMS IN FIXED DIMENSION, Journal of algorithms, 21(3), 1996, pp. 579-597
LINES IN-SPACE - COMBINATORICS AND ALGORITHMS
Authors: CHAZELLE B EDELSBRUNNER H GUIBAS LJ SHARIR M STOLFI J
Citation: B. Chazelle et al., LINES IN-SPACE - COMBINATORICS AND ALGORITHMS, Algorithmica, 15(5), 1996, pp. 428-447
BOUNDS ON THE SIZE OF TETRAHEDRALIZATIONS
Authors: CHAZELLE B SHOURABOURA N
Citation: B. Chazelle et N. Shouraboura, BOUNDS ON THE SIZE OF TETRAHEDRALIZATIONS, Discrete & computational geometry, 14(4), 1995, pp. 429-444
AN ELEMENTARY APPROACH TO LOWER BOUNDS IN GEOMETRIC DISCREPANCY
Authors: CHAZELLE B MATOUSEK J SHARIR M
Citation: B. Chazelle et al., AN ELEMENTARY APPROACH TO LOWER BOUNDS IN GEOMETRIC DISCREPANCY, Discrete & computational geometry, 13(3-4), 1995, pp. 363-381
IMPROVED BOUNDS ON WEAK EPSILON-NETS FOR CONVEX-SETS
Authors: CHAZELLE B EDELSBRUNNER H GRIGNI M GUIBAS L SHARIR M WELZL E
Citation: B. Chazelle et al., IMPROVED BOUNDS ON WEAK EPSILON-NETS FOR CONVEX-SETS, Discrete & computational geometry, 13(1), 1995, pp. 1-15
RAY SHOOTING IN POLYGONS USING GEODESIC TRIANGULATIONS
Authors: CHAZELLE B EDELSBRUNNER H GRIGNI M GUIBAS L HERSHBERGER J SHARIR M SNOEYINK J
Citation: B. Chazelle et al., RAY SHOOTING IN POLYGONS USING GEODESIC TRIANGULATIONS, Algorithmica, 12(1), 1994, pp. 54-68
ALGORITHMS FOR BICHROMATIC LINE-SEGMENT PROBLEMS AND POLYHEDRAL TERRAINS
Authors: CHAZELLE B EDELSBRUNNER H GUIBAS LJ SHARIR M
Citation: B. Chazelle et al., ALGORITHMS FOR BICHROMATIC LINE-SEGMENT PROBLEMS AND POLYHEDRAL TERRAINS, Algorithmica, 11(2), 1994, pp. 116-132
SELECTING HEAVILY COVERED POINTS
Authors: CHAZELLE B EDELSBRUNNER H GUIBAS LJ HERSHBERGER JE SEIDEL R SHARIR M
Citation: B. Chazelle et al., SELECTING HEAVILY COVERED POINTS, SIAM journal on computing, 23(6), 1994, pp. 1138-1151
AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION
Authors: CHAZELLE B
Citation: B. Chazelle, AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION, Discrete & computational geometry, 10(4), 1993, pp. 377-409
HOW HARD IS HALF-SPACE RANGE SEARCHING
Authors: BRONNIMANN H CHAZELLE B PACH J
Citation: H. Bronnimann et al., HOW HARD IS HALF-SPACE RANGE SEARCHING, Discrete & computational geometry, 10(2), 1993, pp. 143-155
DIAMETER, WIDTH, CLOSEST LINE PAIR, AND PARAMETRIC SEARCHING
Authors: CHAZELLE B EDELSBRUNNER H GUIBAS L SHARIR M
Citation: B. Chazelle et al., DIAMETER, WIDTH, CLOSEST LINE PAIR, AND PARAMETRIC SEARCHING, Discrete & computational geometry, 10(2), 1993, pp. 183-196
COMPUTING A FACE IN AN ARRANGEMENT OF LINE SEGMENTS AND RELATED PROBLEMS
Authors: CHAZELLE B EDELSBRUNNER H GUIBAS L SHARIR M SNOEYINK J
Citation: B. Chazelle et al., COMPUTING A FACE IN AN ARRANGEMENT OF LINE SEGMENTS AND RELATED PROBLEMS, SIAM journal on computing, 22(6), 1993, pp. 1286-1302
Risultati: 1-15 |