Авторизация
Поиск по указателям
Samet H. — The design and analysis of spatial data structures
Обсудите книгу на научном форуме
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: The design and analysis of spatial data structures
Автор: Samet H.
Аннотация: Spatial data consist of points, lines, rectangles, regions, surfaces, and volumes. The representation of such data is becoming increasingly important in applications in computer graphics, computer vision, database management systems, computer-aided design, solid modeling, robotics, geographic information systems (GIS), image processing, computational geometry, pattern recognition, and other areas. Once an application has been specified, it is common for the spatial data types to be more precise. For example, consider a geographic information system (GIS). In such a case, line data are differentiated on the basis of whether the lines are isolated (e.g., earthquake faults), elements of tree-like structures (e.g., rivers and their tributaries), or elements of networks (e.g., rail and highway systems). Similarly region data are often in the form of polygons that are isolated (e.g., lakes), adjacent (e.g., nations), or nested (e.g., contours). Clearly the variations are large.
Язык:
Рубрика: Computer science /Алгоритмы /
Статус предметного указателя: Готов указатель с номерами страниц
ed2k: ed2k stats
Год издания: 1990
Количество страниц: 493
Добавлена в каталог: 22.11.2005
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Geographic Information Systems (GIS) vii—ix 100 113 153
Geometree 328
Geometric join query 157
German, S. xii
Gervautz, M. 430
Gholzadeh, B. 454
Gibson, L. 21 430
Gillespie, R. 330 430
Ginsburg, Y. 436
GIS see “Geographic information systems”
Glassner, A.S. 330 430
global 411
Globe 21 23
Goel, S. 435
Goldak, J. xii 11 436
Goldberg, M. 418
Goldschlager, L.M. 14 384 430
Goldstein, R.A. 430
Gomez, D. 367 431
Goodchild, M.F. 14 378 384 431
Goral, C.M. 431
Gordon, D. 431
Gordon, P. xii
Gorsky, N.D. 431
Gosen, F. 440
Gouraud, H. 431
Gouzenes, L. 431
Gowda, I.G. 431
Graham, S. x 411 418
Grandfield, A.W. 14 378 384 431
Grant, E.D. 25 429
Graphical search and replace 198
Gray code 8 10 109—110
Gray level 6
Gray node 4
Gray-scale image 2
Greedy triangulation 292
Greedy-method heuristic 387
Greenberg, D.P. 423 431 434 461
Greene, D. 431
Grid block 135
Grid directory, edge-EXCELL 265
Grid directory, EXCELL 141
Grid directory, grid file 755
Grid file 112 135—141 149 156
Grid file, bucket merging 139—140
Grid file, directory merging 740
Grid file, grid directory 755
Grid file, grid refinement 759
Grid file, rectangle intersection problem 196
Grid file, rectangle representation 196 199
Grid refinement, EXCELL 142
Grid refinement, grid file 139
Gridded digital terrain model 366
Grosky, N.D. 15 416
Grosky, W.I. 37 380 431 440
Grouping step 6
Grunbaum, B. 18 431
Guevara, J.A. 439
Guibas, L.J. ix 166 173 287 293 297 299 401—402 421 427 431
Gunther, O. 223 231 396 431
Guttman, A. 113 199 219—221 432
Guzman, A. 367 431
H-rectangle 182
h-refinement 369
Habermann, A.N. 412 462
Hachem, N.I. 432
Haken, D. 174 419
Halfspace 65
Halfspace, active 342
Halfspace, constant of a 340
Halfspace, translation 356
Halfspace, value of a 340
HALFSPACE_TO_BINTREE 344
Halting point 158
Halustchak, 0. 447
Hamalainen, J. 344 359 405 416 458
Hamilton, J.W. xii
Hanrahan, P. 432
Hanson, E. 222 457
Hao, L.V. 111 113 153 442
Harada, L. 437
Haralick, R.M. 432
Harary, F. 180 216 263 287—288 294 432
Hardas, D.M. 432
Hardware 339
Hart, P.E. 425
Hashing 47
Hashing function 117
Hatched region 54 56—58
Hayward, V. 432
hB-tree 101
Heap 412
Hebert, M. 231 319 367 370 428
Hecht, M.S. 432
Heckbert, P.S. 432
Height-balanced tree 72 (also see “AVL tree”)
Henderson, P. 432
Henderson, T.C. 433
Herbert, F. 433
Herman, G.T. 417 422
Herman, M. 433 456
Hertel, S. 287 292 401 433
Herzog, H. 105—108 459
Hexagon 324
Hexagonal grid 21 (also see “Hexagonal tiling”)
Hexagonal tessellation see “Hexagonal tiling”
Hexagonal tiling 18 20
hexahedron 23
Hickey, T. 339 423
Hidden-line elimination 10 217 337
Hidden-surface elimination 10 316 339
Hierarchical probe model 27
Hierarchical space indexing method 328
High 304
Hilbert, D. 14 433
Hill 153
Hillier, F.S. 377 433
Hillyard, R.C. 332 420
Hinojosa, A. 368 417
Hinrichs, K. 135 155—156 187 189 196 433
Hinterberger, H. 44 135 139—140 445
Hirschberg, D.S. 433 439
HISON 66
Hoare, C.A.R. 10 433
Hoel, E. xii
Hoey, D. 154 286 389 455
hole 2 29 33 276 338
Holroyd, F. 17 20 418
Homogeneous image 6
Hon, R.W. 174 419
Hong, S.J. 448
Hong, T.H. 13 320—321 420 433 436 447 462
Hooper, G. 461
Hopcroft, J.E. vii 72 105 107 243 277 416
Horizontal rectangle 181
Horowitz, S.L. 6 433
Hoshi, M. 433
Hough transform 114 114—116
Houthuys, P. 433
HSP 341
HSP_EVAL 351
Huang, L. xii
Huang, T.S. 421
Huang, Y.G. 8 40 278 280 452—453
Huffman, D.A. 433
Hunter, G.M. 8 10—11 32—35 91 103 210 236 328 353 369 400 434
Hut, P. 417
Hutflesz, A. 434
Hybrid k-d trie 111 145
Hyytia, K. 359 416
H_MAX 341
H_MIN 341
H_TRAVERSE 344
Ibbs, T.J. 434
Ibrahim, H.A.H. 434
Ichikawa, T. 434
icosahedron 21 23 26
if 412
Image 1
Image processing vii ix 10
Image understanding 11
Image, binary 2
Image, border 2
Image, gray-scale 2
Image, homogeneous 6
Image-space hierarchies 2 44
Immel, D.S. 423 434
In core see “Core main
Inactive node 765
Incompatible q-fragments 274
Independent vertices 288
INIT_HALFSPACES 349
Inner approximation 29 31
Insertion, quadtree 243—246
Insertion, quadtree 258—260
Insertion, quadtree 262
Insertion, k-d tree 68—72
Insertion, MX quadtree 87—89
Insertion, MX-CIF quadtree 202—206
Insertion, point quadtree 49—53
Insertion, PR quadtree 95—97
INSERT_AXIS 205
Insert_quadrant 59
int 178
Interference detection 316
Interior 3
Interior node 33 336
Interpolation 319 366 379
Interval arithmetic 357 357—359
Interval tree 165 165—171 201
Interval tree, rectangle intersection problem 165—171
INTERVAL_EVALUATE 358
INTERVAL_HSP_EVAL 358
Inverse priority search tree 84 84—85 174
Inverted list 46 48 149
Iri, M. 388 434 445
Ismail, M.G.B. 434
Isohedral tiling 17
Isolated point 242
Isometric view 20 325
Iwata, K. 330 429
Iyengar, S.S. xii 5 236 430 435 441—442 449 454
Jaatinen, A. 359 416
Jackins, C.L. 11 330 434
Jackson, M.J. 17 20 418
Jain, R. 37 380 431 440
Jansen, F.W. xii 339 435 457
Jared, G.E.M. 435
Javis, J.F. 435
Jensen, K. x 411 435
Johnsen, O. 91 424
Johnson, D.S. 7 15 430
Joining triangulations 579
Jones, L. 435
Joshi, R.C. 435
Jou, E. xii
Joy, K.I. 435
Juan, R. 328 417
Judice, C.N. 435
k-d tree 23 66 66—80 101 149 156
k-d tree, Boolean query 79
k-d tree, comparison with a point quadtree 80
k-d tree, deletion 73—77
k-d tree, insertion 68—72
k-d tree, partial match query 80 382
k-d tree, partial range query 79 (also see “partial match query”)
k-d tree, point query 79
k-d tree, range query 77 79
k-d tree, rectangle representation 196 198
k-d tree, replacement node 73—74
k-d tree, search 77—80
k-d tree, superkey see “Superkey”
k-d trie 93 107
k-d-B-tree 106 113 222—223
K-structure 287—293 307 310—311 313
K-structure, dynamic update 308—309
K-structure, point location problem 291
k-vertex 288
Kajia, J.T. 435
Kak, A.C ix 161 450
Kakazu, Y. 338—339 445
Kambhampati, S. 416 435
Kanatani, K. 24 435
Kapenga, J. 449
Kaplan, M.R. 435
Karlsson, R.G. 435
Karonen, O. 344 359 405 416 435 458
Kasif, S. 436
Katajainen, J. 436
Kaufman, A. 436
Kawaguchi, E. 8 10—11 32 336 436
kB-tree 141
KD_COMPARE 68
KD_DELETE 76
KD_DELETE1 76
KD_INSERT 68
Kedem, G. 199—200 436
Kedem, Z.M. 25 67 223 429
Kela, A. xii 11 369 436
Kelly, M.D. 11 436
Kent, E.W. 436
Kernighan, B.W. x 411 436
Kerola, P. 435
Kersten, M.L. 380 436
Key 14
Kikuchi, L. 439
Kim, Y.C. 5 437
King, T.R. 446
Kirk, D. xii 45 417
Kirkpatrick, D. ix 287 424—^25 431 437
Kitsuregwa, M. 437
Klee, V. 178 437
Klein bottle 327
Kleiner, A. 437
Klinger, A. ix 8 10 236 416 437 446 458
Knott, G.D. xi 111 117 387 403 422 437 441
Knowlton, K. 23 437
Knuth, D.E. x—xi 8 13 44 46—47 52—53 65 72 79 83 101 117—118 132 139 295 383 385 437
Kobayashi, H. 437
Koistinen, P. 344 359 405 437 458
Kokubo, I. 426
Kollias, J.G. 420—421
Kollias, V.J. 420—421
Koparkar, P.A. 358—359 366 444
Koppinen, M. 436
Korhonen.P. 458
Korn, M.R. 438
Kriegel, H.P. 141 432 438 454
Krishnamurthy, R. 438
Kronlof, K. 438
Kropatsch, W.G. 13 438
Kubo, H. 338—339 445
Kubota, H. 437
Kumar, P.S. 438
Kunii, T.L. 20 322 324 328 330 337 339 360 364—365 409 425 429 438 441 462
Kurlander, D. 393 438
Kushner, T. 438
Kusuma, N. xii
L 202
Реклама