Авторизация
Поиск по указателям
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
Предметный указатель
Laflin, S. 420
Lake vii 153 227
Lakhani, N.B. 430
Lambert's cylindrical projection 23
Landis, Y.M. 72 105 107 415
Landy, M. 25 423 457
Lane, J.M. 438
Larson, P.A. xii 117 120 124—125 131 134 386 438
Laurini, R. 15 439
Lauther, U. 194 439
Lauzon, J.P. 439 441
Lavakusha 439
Lavin, M.A. 440
Lawler, E. 15 388 439
Layered dag 299 299—300 300—311 313
Layered dag, dynamic update 309
Layered dag, point location problem 302
LAYERED_DAG_POINT_LOCATION 304
LDB octant 408
LDF octant 408
ldnode 304
Le Corre, J.F. 430
Lea, D. 439
leaf node 4
Least square quadtree 236
Lee, D.T. 48 62 65 77 79 175 180 287 293 381 388 392 431 439
Lee, Y.T. 339 345 439
Left 81 242 304 341
Leifker, D. 113 222 384 451
Leighton, R.B. 428
Lelewer, D.A. 439
LeMaster, R.J. 440
LEN 178 242
Lenstra, J.K. 15 439
Letelier, P. 91 440
Level 4
Li, C.C. 428
Li, H. 440
Li, M. 37 380 431 440
Li, S.X. 440
Libera, F.D. 440
Lieberman, G.J. 377 433
Limited tiling 18 20
Line 242
Line data see “Curvilinear data”
line drawing 337
Line intersection problem 176
Line quadtree 237 237—239 313
Linear edge quadtree 280
Linear halfspace 25 339 340
Linear hashing 107 116—124 146—147 150
Linear probing 132
Linear quadtree 32 100 252
Lingas, A. 7 440
Linn, J. 80 440
Lipton, R.J. 286—287 424—425 440
Lischinski, D. xii
Lisp 412
LIST 412
LITMAX 108
Little, J.J. 230 234 440
Litwin, W. 107 117 440
Liu, W. 443
Lloyd, J.W. 120 449
Lo, R.S. 460
Load factor 141
Location parameters 757
Locational code 32 252
Loew, M.H. 440
Lomet, D. 101 440
Loop 557 333
LOSON 66
Low 304
Lozano-Perez, T. 11 231 420 430 440
Lu, S. 458
LUB octant 408
Lucas, D. 21 430
Lueker, G. 48 440
LUF octant 408
Lum, V.Y. 440
Lumia, R. 440 456
Lyche, T. 227 365 423
Main memory 131 (also see “Core”)
Mairson, H.G. 402 441
Manhattan distance 75
Manhattan metric 56
Manohar, M. 236 430 438 441 449
Mantyla, M. ix 316 331—333 441 458
MAO x 438 441
Map overlay problem 311
Marble, D. xii 312 441
Margalit, A. 403 441
Mark 160 178
Mark, D.M. 439 441
Marsh, S.C. 441
Martin, G.N.N. 125 131 441
Martin, J.J. 236 442
Martin, M. 442
Martin, W.N. 320 442
Mason, D.C. 442
Mat see “Medial axis transformation”
Mathieu, C. 442
Matrix manipulation 91—92
Matrix transpose 91—92
Matsui, S. 388 434
Matsunaga, J. 8 436
Matsuyama, T. 111 113 153 442
Maurer, H.A. 48 80 175 391 419 427
Maximal 4
Maximal block representation 6
Maximum clique 180 185 388 392
Mazumder, P. 442
McCarthy, J. 412 442
McCluskey, E.J. 8 442
McCreight, E.M. 83 166 171 173 190 389 393 442
McDonald, R. xi
McDonell, K.J. 113 197 199 446
McKeown, D.M.Jr. 442
MDBT 141
Meagher, D. xii 11 36 316 326 339 345 353 355 380 442—443
Mean gray level 6
Measure problem 178 178—186
Medial axis transformation (MAT) 5
Medical image processing 11 315
Mehlhorn, K. ix 287 292 401 433 443
Mehrotra, R. 431
Mei, G.G. 443
Memory see “Main memory core”
Menon, S. 443 456
Merge step 6
Merging 4
Merging triangulations 319
Merging, quadtree 246
Merrett, T.H. 14 106 120 141 443 446
Merrill, R.D. 312 443
Mesh generation 11
Mesztenyi, C.K. 11 450
Michener, J. 443
Miiford, D. 443 462
Miller, R. 443
Minimum-weight triangulation 292
Minsky, M. 443
Mitjonen, M. 435
MLOPLH see “Multilevel order preserving linear hashing”
Mobasseri, B.G. 443
Mobius strip 327
Molecular tile 17
Montani, C. 427
Monte Carlo methods 346
Moore, R.E. 359 443
Moreton, H.P. 422
Morris, D.T. 424
Morrison, R. 359 423
Mortenson, M.E. 443
Morton order 4 14 14—15 378
Morton, G.M. 4 10 14 106 444
Mount, D. xii 369 377 425
Mudur, S.P. 358—359 366 444
Muller, H. 422
Mullin, J.K. 125 131 133—134 386 444
Multiattribute data 45
Multicolored quadtree 8
Multidimensional searching ix
Multidimensional sorting 154
Multilevel order preserving linear hashing (MLOPLH) 123
Multipaging 141
multiprocessor 80
Multiresolution ix 12
Muntz, R. xii
Muraka, R. 420
Muralikrishna, M. 444
Murota, K. 388 434 445
Mussi, P. 231 319 367 370 428
MX bintree 92
MX octree 335 335—337
MX quadtree 33 86 86—92 149 201 235—236 239 279 282 313 335—336
MX quadtree, comparison with a point quadtree 104—105
MX quadtree, comparison with a PR quadtree 104—105
MX quadtree, complete see “Complete MX quadtree”
MX quadtree, deletion 89—91
MX quadtree, insertion 87—89
MX quadtree, range query 91
MX quadtree, shape 104
MX quadtree, size 104
MX quadtrie 86
MX-CIF quadtree 200—213 216—217
MX-CIF quadtree, check for overlapping rectangles 209—211
MX-CIF quadtree, deletion 206—209
MX-CIF quadtree, insertion 202—206
MX-CIF quadtree, range query 210
MX-CIF quadtree, rectangle intersection problem 211
MX-CIF quadtree, set-theoretic operations 210
MX_COMPARE 87
MX_DELETE 90
MX_INSERT 88
N order 14
N-tree 106
Naamad, A. 431
Nagao, M. 111 113 153 442
Nagel, R. 430
Nagy, G. ix xii 227 312 367 424 444
Nair, K.N.R. 444
Nakamae, E. 445
Nakamura, T. 437
Nakamura, Y. 444
NAME 49 66 87 93 202
Nandy, S.K. 444
Nash, C. 416
Nasty node 361
Nation vii
Naur, P. x 411 444
Navazo, I. 328—330 403 417 420 444
Naylor, B.F. 25 67 223 429 458
NE quadrant 4 (also “Corner vertex”)
Nearest common ancestor 166—167
Negative boundary node 361
Neighbor system 139
Neighborhood of a K-vertex 288
Nelson, G. xii
Nelson, R.C. xii 8 40 111—112 239 265 267—269 272 278 280 364 400 444—445 452—453 455
Nemoto, K. 445
Networks, highway vii
Networks, rail vii
Newell, M.E. 445
NEWROOT 59 61
NeXT 243
Nievergelt, J. 44 107 109 112 117 135 139—141 155 187 189 196 402 427 433 445
Nilsson, N.J. 10 445
Ninke, W.H. 435
Nishimura, S. 437
Nishita, T. 445
Nishitani, Y. 445
Noborio, H. 321 445
Node 48 87 93 242
Node, active 168
Node, boundary 33 335
Node, edge 327
Node, empty 361
Node, exterior 33 336
Node, face 327
Node, full 5 361
Node, gray 4
Node, inactive 168
Node, interior 33 336
Node, leaf 4
Node, nasty 361
Node, negative boundary 361
Node, nonleaf 4
Node, positive boundary 361
node, root 4
Node, vertex 327
Node, void 5
NODETYPE 87 93 242
Noma, T. 441
Non-trivial subtree 63
Nondegenerate object 354
Nonleaf node 4
Nonlinear halfspace 339 357
Nonpolygonal tilings 26—31
normal 27
Noronha, V.T. 445
NP-completeness 7 15
Null object 352
NULL-object detection algorithm 346 354—355
NW quadrant 4 (also “Corner vertex”)
o x
Obel 5
Object extent 155
Object-space hierarchies 2 44
Oblique parallel projection 321
Occupancy 111
octahedron 23
Octant 5
Ohsawa, Y. 101 444—445 451
Ohya, T. 445
Okawara, F. 445
Okino, N. 338—339 445
Oliver, M.A. 446
Olsen, D.R.Jr. 446
Omachi, T. 445
OMEGA ( ) x
Omolayole, J.O. 236 446
One-dimensional region quadtree 161
Onuoha, D. 420
Ooi, B.C. 113 197 199 446
OPDIRECTION 206
OPLH see “Order preserving linear hashing”
OPQUAD 55
Optimal position of a region quadtree 37—41
Optimized k-d tree 70
Optimized point quadtree 52 52 72 380
Order preserving linear hashing (OPLH) 120 120—123
Ordinary hierarchy 19
Orenstein, J.A. 14 93 106—107 111 120 123 143 145 384
Oriented 327
Orivouri, E. 435
Orthogonal partition tree 182
Orthographic parallel projection 321
Oskard, D.N. 447
Osse, W. 447
Реклама