Entry Dobkin:1983:FDP from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Dobkin:1983:FDP,
author = "D. P. Dobkin and D. G. Kirkpatrick",
title = "Fast detection of polyhedral intersection",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "241--253",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational geometry; geometric computing; geometry;
plane-polyhedron intersection; polyhedral intersection;
polyhedron-polyhedron intersection; preprocessed
polyhedra; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bound,
10(1)1,
10(1)53,
10(1)83,
11(3)321,
12(3)339,
14(1)19,
14(1)103,
14(3)337,
15(3)311,
16(3)307,
19(1)39,
22(3)233,
22(3)285,
23(1)95,
23(2)171,
23(2)211,
24(3)239,
25(1)1,
26(1)25,
27(1)3,
28(3)263,
28(3)337,
29(1)75,
29(1)123,
30(3)319,
32(1)173
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
12(3)291,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)289,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)1,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(2)179,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(1)3,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- computing,
10(2)133,
12(3)255,
26(3)343,
29(1)123,
31(1)83
- detection,
22(3)297,
24(2)179,
24(3)221
- Dobkin, D. P.,
11(1)1
- fast,
19(3)253,
21(1)105,
24(3)239
- geometric,
32(1)215
- intersection,
21(1)75,
27(1)85,
32(3)279
- method,
10(1)53,
11(3)341,
12(1)97,
12(2)193,
12(3)315,
13(2)175,
13(3)239,
17(1)99,
17(3)259,
19(1)29,
22(1)195,
23(1)91,
23(2)211,
24(1)1,
25(1)67,
27(1)167,
28(3)287,
29(1)27,
30(2)139
- numerical,
12(2)193,
17(1)99,
22(1)195,
22(3)317,
23(2)211
- other,
12(1)19,
12(1)97,
15(2)181,
15(3)223,
16(2)149,
17(3)317,
19(1)69,
19(2)143,
22(1)19,
24(1)1,
25(2)95,
32(1)77,
34(1)227
- upper,
16(1)93,
22(3)285,
24(3)239,
27(1)3,
28(3)263,
29(1)123,
30(3)319,
32(1)173