-
1
-
-
0032266683
-
Efficient algorithms for geometric optimization
-
P.K. Agarwal, and M. Sharir Efficient algorithms for geometric optimization ACM Comput. Surv. 30 1998 412 458
-
(1998)
ACM Comput. Surv.
, vol.30
, pp. 412-458
-
-
Agarwal, P.K.1
Sharir, M.2
-
3
-
-
0003140383
-
Computing the Fréchet distance between two polygonal curves
-
H. Alt, and M. Godau Computing the Fréchet distance between two polygonal curves Internat. J. Comput. Geom. Appl. 5 1995 75 91
-
(1995)
Internat. J. Comput. Geom. Appl.
, vol.5
, pp. 75-91
-
-
Alt, H.1
Godau, M.2
-
4
-
-
85154002090
-
Sorting networks and their applications
-
AFIPS Press Reston, VA
-
K.E. Batcher Sorting networks and their applications Proc. 1968 Spring Joint Computer Conf. 1968 AFIPS Press Reston, VA 307 314
-
(1968)
Proc. 1968 Spring Joint Computer Conf.
, pp. 307-314
-
-
Batcher, K.E.1
-
6
-
-
0010247052
-
The LEDA class real number
-
Max-Planck Institut Inform., Saarbrücken, Germany, January
-
C. Burnikel, K. Mehlhorn, S. Schirra, The LEDA class real number, Technical Report MPI-I-96-1-001, Max-Planck Institut Inform., Saarbrücken, Germany, January 1996
-
(1996)
Technical Report MPI-I-96-1-001
-
-
Burnikel, C.1
Mehlhorn, K.2
Schirra, S.3
-
7
-
-
0033461748
-
Geometric applications of a randomized optimization technique
-
T.M. Chan Geometric applications of a randomized optimization technique Discrete Comput. Geom. 22 4 1999 547 567
-
(1999)
Discrete Comput. Geom.
, vol.22
, Issue.4
, pp. 547-567
-
-
Chan, T.M.1
-
8
-
-
0001532918
-
Geometric pattern matching under Euclidean motion
-
L.P. Chew, M.T. Goodrich, D.P. Huttenlocher, K. Kedem, J.M. Kleinberg, and D. Kravets Geometric pattern matching under Euclidean motion Computational Geometry 7 1997 113 124 (Pubitemid 127388335)
-
(1997)
Computational Geometry: Theory and Applications
, vol.7
, Issue.1-2
, pp. 113-124
-
-
Chew, L.P.1
Goodrich, M.T.2
Huttenlochera, D.P.3
Kedem, K.4
Kleinberg, J.M.5
Kravets, D.6
-
9
-
-
0023271105
-
Slowing down sorting networks to obtain faster sorting algorithms
-
DOI 10.1145/7531.7537
-
R. Cole Slowing down sorting networks to obtain faster sorting algorithms J. ACM 34 1 1987 200 208 (Pubitemid 17601589)
-
(1987)
Journal of the ACM
, vol.34
, Issue.1
, pp. 200-208
-
-
Cole Richard1
-
10
-
-
0024057356
-
Parallel merge sort
-
R. Cole Parallel merge sort SIAM J. Comput. 17 4 1988 770 785
-
(1988)
SIAM J. Comput.
, vol.17
, Issue.4
, pp. 770-785
-
-
Cole, R.1
-
11
-
-
0024716010
-
An optimal-time algorithm for slope selection
-
R. Cole, J. Salowe, W. Steiger, and E. Szemerédi An optimal-time algorithm for slope selection SIAM J. Comput. 18 4 1989 792 810
-
(1989)
SIAM J. Comput.
, vol.18
, Issue.4
, pp. 792-810
-
-
Cole, R.1
Salowe, J.2
Steiger, W.3
Szemerédi, E.4
-
13
-
-
0242333224
-
Geometry helps in bottleneck matching and related problems
-
A. Efrat, A. Itai, and M.J. Katz Geometry helps in bottleneck matching and related problems Algorithmica 31 1 2001 1 28 (Pubitemid 33709125)
-
(2001)
Algorithmica (New York)
, vol.31
, Issue.1
, pp. 1-28
-
-
Efrat, A.1
Itai, A.2
Katz, M.J.3
-
14
-
-
0000705538
-
Fast algorithms for collision and proximity problems involving moving geometric objects
-
DOI 10.1016/0925-7721(95)00028-3
-
P. Gupta, R. Janardan, and M. Smid Fast algorithms for collision and proximity problems involving moving geometric objects Computational Geometry 6 1996 371 391 (Pubitemid 126374913)
-
(1996)
Computational Geometry: Theory and Applications
, vol.6
, Issue.6
, pp. 371-391
-
-
Gupta, P.1
Janardan, R.2
Smid, M.3
-
15
-
-
0036970559
-
Labeling points with rectangles of various shapes
-
DOI 10.1142/S0218195902001018
-
A. Koike, S. Nakano, T. Nishizeki, T. Tokuyama, and S. Watanabe Labeling points with rectangles of various shapes Internat. J. Comput. Geom. Appl. 12 6 2002 511 528 (Pubitemid 36136714)
-
(2002)
International Journal of Computational Geometry and Applications
, vol.12
, Issue.6
, pp. 511-528
-
-
Koike, A.1
Nakano, S.-I.2
Nishizeki, T.3
Tokuyama, T.4
Watanabe, S.5
-
16
-
-
0001716715
-
Combinatorial optimization with rational objective functions
-
N. Megiddo Combinatorial optimization with rational objective functions Math. Oper. Res. 4 1979 414 424
-
(1979)
Math. Oper. Res.
, vol.4
, pp. 414-424
-
-
Megiddo, N.1
-
17
-
-
0020828745
-
Applying parallel computation algorithms in the design of serial algorithms
-
DOI 10.1145/2157.322410
-
N. Megiddo Applying parallel computation algorithms in the design of serial algorithms J. ACM 30 4 1983 852 865 (Pubitemid 14468704)
-
(1983)
Journal of the ACM
, vol.30
, Issue.4
, pp. 852-865
-
-
Megiddo Nimrod1
-
18
-
-
0017996610
-
New parallel-sorting schemes
-
F.P. Preparata New parallel-sorting schemes IEEE Trans. Comput. C-27 1978 669 673
-
(1978)
IEEE Trans. Comput.
, vol.27
, pp. 669-673
-
-
Preparata, F.P.1
-
19
-
-
0030704371
-
Computing the minimum diameter for moving points: An exact implementation using parametric search
-
J. Schwerdt, M. Smid, and S. Schirra Computing the minimum diameter for moving points: an exact implementation using parametric search Proc. 13th Annu. ACM Sympos. Comput. Geom. 1997 466 468
-
(1997)
Proc. 13th Annu. ACM Sympos. Comput. Geom.
, pp. 466-468
-
-
Schwerdt, J.1
Smid, M.2
Schirra, S.3
-
20
-
-
0010251535
-
-
MS Thesis, Dept. Comput. Sci., Tel Aviv Univ., Tel Aviv
-
S. Toledo, Extremal polygon containment problems and other issues in parametric searching, MS Thesis, Dept. Comput. Sci., Tel Aviv Univ., Tel Aviv, 1991
-
(1991)
Extremal Polygon Containment Problems and Other Issues in Parametric Searching
-
-
Toledo, S.1
-
21
-
-
0001261631
-
Parallelism in comparison problems
-
L. Valiant Parallelism in comparison problems SIAM J. Comput. 4 3 1975 348 355
-
(1975)
SIAM J. Comput.
, vol.4
, Issue.3
, pp. 348-355
-
-
Valiant, L.1
|