-
4
-
-
0028257199
-
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
-
S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573-582, 1994.
-
(1994)
Proc. 5th ACM-SIAM Sympos. Discrete Algorithms
, pp. 573-582
-
-
Arya, S.1
Mount, D.M.2
Netanyahu, N.3
Silverman, R.4
Wu, A.Y.5
-
5
-
-
0032201716
-
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
-
S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45:891-923, 1998.
-
(1998)
J. ACM
, vol.45
, pp. 891-923
-
-
Arya, S.1
Mount, D.M.2
Netanyahu, N.3
Silverman, R.4
Wu, A.Y.5
-
7
-
-
0029239056
-
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
-
P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
-
(1995)
J. ACM
, vol.42
, pp. 67-90
-
-
Callahan, P.B.1
Kosaraju, S.R.2
-
8
-
-
84968509410
-
Lower bounds on the complexity of polytope range searching
-
B. Chazelle. Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc., 2:637-666, 1989.
-
(1989)
J. Amer. Math. Soc.
, vol.2
, pp. 637-666
-
-
Chazelle, B.1
-
9
-
-
0003772933
-
-
Springer-Verlag, Berlin, Germany, 2nd edition
-
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
-
(2000)
Computational Geometry: Algorithms and Applications
-
-
De Berg, M.1
Van Kreveld, M.2
Overmars, M.3
Schwarzkopf, O.4
-
10
-
-
0021467937
-
Storing a sparse table with O(1) worst case access time
-
M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
-
(1984)
J. ACM
, vol.31
, Issue.3
, pp. 538-544
-
-
Fredman, M.L.1
Komlos, J.2
Szemeredi, E.3
-
13
-
-
0001472827
-
On some geometric optimization problems in layered manufacturing
-
J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Comput. Geom. Theory Appl., 12:219-239, 1999.
-
(1999)
Comput. Geom. Theory Appl.
, vol.12
, pp. 219-239
-
-
Majhi, J.1
Janardan, R.2
Smid, M.3
Gupta, P.4
-
14
-
-
51249161633
-
Range searching with efficient hierarchical cuttings
-
J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
-
(1993)
Discrete Comput. Geom.
, vol.10
, Issue.2
, pp. 157-182
-
-
Matoušek, J.1
-
15
-
-
0034417244
-
On approximate geometric k-clustering
-
J. Matoušek. On approximate geometric k-clustering. Discrete and Comput. Geometry, 24:61-84, 2000.
-
(2000)
Discrete and Comput. Geometry
, vol.24
, pp. 61-84
-
-
Matoušek, J.1
-
16
-
-
51249163351
-
On ray shooting in convex polytopes
-
J. Matoušek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10(2):215-232, 1993.
-
(1993)
Discrete Comput. Geom.
, vol.10
, Issue.2
, pp. 215-232
-
-
Matoušek, J.1
Schwarzkopf, O.2
|