Last update: Fri Jan 5 02:08:04 MST 2018
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{Mahoney:2003:APC,
author = "William R. Mahoney",
title = "The ``All-Pairs Closest Points'' Problem",
journal = j-DDJ,
volume = "28",
number = "1",
pages = "48--49, 51",
month = jan,
year = "2003",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jun 12 05:46:20 MDT 2003",
bibsource = "http://www.ddj.com/articles/2003/0301/;
http://www.math.utah.edu/pub/tex/bib/dr-dobbs-2000.bib",
URL = "http://www.ddj.com/documents/s=7758/ddj0301f/",
abstract = "The divide-and-conquer algorithm William presents here
recursively partitions the set of points into two
halves, then solves for the halves plus a strip in the
middle.",
acknowledgement = ack-nhfb,
journal-URL = "http://www.ddj.com/",
}
Related entries
- 26-3-50, 26-6-85,
26(7)21,
26(8)118,
26(10)91
- 26-7-62,
26(8)111,
26(7)105,
26(12)115
- 26-9-130,
27(1)108,
26(10)130,
26(11)87,
26(12)20
- 27-12-54,
28(5)37,
28(2)75
- 27-9-42,
27(10)z
- algorithm, 25-1-10,
25(1)113,
25(2)123,
25(2)135,
25(3)123,
25(4)23,
25(4)111,
25(5)119,
25(6)131,
25(7)18,
25(7)133,
25(8)133,
25(9)29,
25(9)133,
25(10)18,
25(10)147,
25(11)149,
25(12)18,
25(12)149,
26(1)18,
26(1)189,
26(2)18,
26(3)18,
26(3)137,
26(4)18,
26(4)21,
26(4)145,
26(5)141,
26(6)151,
26(7)132,
26(8)118,
26(9)121,
26(10)123,
26(11)21,
26(11)117,
26(12)115,
27(2)98,
27(3)97,
27(4)101,
27(5)21,
27(5)89,
27(6)94,
27(7)93,
27(8)z-8,
27(9)89,
27(10)36,
28(5)66
- conquer, divide-and-,
25(4)23
- divide-and-conquer,
25(4)23
- Mahoney, William R.,
26(1)189,
27(2)98
- solve,
25(9)21,
26(12)23
- two,
25(3)23,
26(11)111,
27(9)14,
28(2)12,
28(3)42,
28(5)80