Entry Edelsbrunner:1985:CED from jalg.bib
Last update: Sat Oct 14 02:35:45 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Edelsbrunner:1985:CED,
author = "H. Edelsbrunner",
title = "Computing the extreme distances between two convex
polygons",
journal = j-J-ALG,
volume = "6",
number = "2",
pages = "213--224",
month = jun,
year = "1985",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(85)90039-2",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:14:21 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0196677485900392",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- computing,
2(2)164,
2(2)186,
4(2)121,
4(2)163,
7(2)285,
8(2)173,
11(3)492,
12(1)75,
12(2)204,
12(4)639,
14(2)226,
15(2)314,
16(1)24,
19(3)383,
20(3)459,
20(3)581,
21(2)240,
21(3)657,
23(1)32,
24(1)158,
25(2)221,
29(2)204,
33(2)187,
34(2)222,
36(2)241,
41(1)52,
49(2)284,
58(2)134,
59(2)125,
62(1)1
- convex,
2(2)122,
4(4)324,
6(1)17,
6(3)359,
6(3)381,
7(2)285,
8(1)66,
8(3)372,
9(1)18,
11(1)85,
11(4)564,
12(1)75,
12(3)359,
14(3)381,
20(2)244,
21(2)240,
21(3)508,
21(3)657,
25(1)177,
26(2)209,
27(1)147,
29(2)238,
50(2)134
- distance,
1(4)359,
4(2)121,
11(4)581,
29(2)238,
30(1)166,
43(2)264,
53(1)85,
61(2)60
- polygon,
2(2)122,
2(2)186,
4(4)324,
6(3)359,
7(2)221,
7(3)369,
7(3)441,
7(4)532,
10(3)327,
11(1)1,
11(4)564,
12(1)75,
12(3)359,
14(1)69,
14(1)139,
17(1)2,
20(2)244,
20(3)459,
21(3)508,
21(3)657,
22(1)142,
26(1)101
- two,
4(2)121,
5(2)231,
6(1)138,
6(3)430,
9(3)411,
12(1)179,
12(4)607,
16(1)110,
20(2)268,
20(2)312,
21(2)415,
21(3)520,
25(2)290,
28(1)21,
33(1)173,
46(2)140,
51(2)170,
57(1)49,
64(2)79