Авторизация
Поиск по указателям
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
Предметный указатель
quadtree 240 240—257 282—284 286 330
quadtree, deletion 246—249
quadtree, insertion 243—246
quadtree, maximum depth 252
quadtree, point location problem 306—307
quadtree 257—261 258 283—284 286
quadtree, deletion 260
quadtree, insertion 258—260
quadtree, point location problem 306
quadtree, rotation 310
quadtree, translation 310
quadtree 261 261—264 283—284 286
quadtree, deletion 263
quadtree, insertion 262
quadtree, point location problem 306
quadtree, rotation 310
quadtree, translation 310
-f quadtree 271 271—275
quadtree 216
quadtree 216
quadtree, circuit extraction 218
-tree 222 222—224
-tree, rectangle intersection problem 224
x
1D_SEARCH 81
1—2 brother tree 107
2-d Fibonacci condition 24 24—25 378
2-d tree 66
2D_SEARCH 81
2—3 tree 243 277 284
4-adjacent, blocks 2
4-adjacent, pixels 2
4—shape 21
7-shape 21
8-adjacent, blocks 2
8-adjacent, pixels 2
9-shape 21
A-series 25
Abdali, S.K. 91 383 415
Abe, S. 444
Abel, D.J. 199—200 214 415 441
Above 304
Abram, G.D. 25 429
Active border 211
Active halfspace 342
Active node 168
Active rectangle 159
Adams, O. 23 415
Adaptive hierarchical coding see “AHC”
Adaptive k-d tree 70 70—71 80 149
Adaptive k-d tree, rectangle representation 194
Adaptive partitioning 70
Adaptive uniform grid 47
Address computation 155—156
Adel'son-Velskii, G.M. 72 105 107 415
Adjacency graph 6
Adjacency number 20
ADJQUAD 60
Adjustment step, polyhedral approximation 371
Agarwal, P. 456
Aggarwal, J.K. 5 320—322 325—326 403 422 437 442
Aging 112—113 113 267
AHC (adaptive hierarchical coding) 25 25—26
Aho, A.V. vii 72 105 107 243 277 416
Ahuja, N. 18 321—324 326 337 355 403 416 447 451 457 460—461
Akman, V. 47 319 403 428—429
Alander, J. 358—359 416
Alexandridis, N. 416 420 463
Alexandrov, V.V. 15 416
Algol x 411
ALGOL W x 411
Alignment problem 368 368—369
Allen, L. xii
Altenhofen, M. 416
Amanatides, J. 416
Amortized cost 250
Anderson, D.P. 100 416
Anderson, D.R. 15 447
Andresen, F.P. 416
Ang, C.-H. xii 416
Angell, I.O. 456
Animation 10
Ansaldi, S. 332 416
Antony, R. xi 417
Antoy, M. xii
Antoy, S. xii
Appel, A.A. 417
Arbib, M.A. 12 450
Arc tree 231 231—235
Architecture 10
Area computation 178 (also see “Measure problem”)
Aref, W. xii
Arimoto, S. 321 445
Arnaldi, B. 417
Arrangement 393
Artzy, E. 417
Arvo, J. xii 45 417
Asano, T. 426
Associated rectangle 183
Atherton, P. 339 417 461
Atkinson, H.H. xii 380 417
Atomic tile 17
Authalic coordinates 23
Avis, D. 387 417 459
AVL tree 72 105 107
axes 201 (also see “Axis lines”)
Axial arrays 141
Axis lines 201 (also see “Axes”)
Ayala, D. 328 330 417 420 444
Azimuth angle 374
Aziz, N.M. 417
B-splines 227
B-tree 106 108 110 113 116 141 150 156 219 221 223 277
Balanced binary search tree 84 176 390
Balanced binary tree 160 163 167
Balanced k-d tree, rectangle intersection problem 195
Balanced k-d tree, rectangle representation 194
Balancing a point quadtree 380
Ballard, D.H. 227—228 230 372 395—396 417
Band 228 230 234
BAND file 101
Barnes, J. 417
Barr, A.H. 368—369 376 456 460
Barrera, R. 367—368 417
Barsky, B.A. 368 454 456
Bartholdi, J.J. 111 388 418
Baskett, F. 46 380 429
Batched dynamic 158
Battaile, B. 431
Bauer, H. x 411 418
Bauer, M.A. 418
Baumgart, B.G. 332—333 418
BDtree 707 101—103 111 116 150
Beaulieu, J.M. 418
Bechtel, F.K. 15
Beck, J. 424
Becker, S. x 411 418
Beckley, D.A. 418
Beer, M. 418
BEGIN 412
Bell, S.B.M. 17 20 418
Below 304
Bent, S.W. 118 250 418
Bentley, J.L. ix 8 11 15 23 31 44—48 52 54 62—63 65—66 68 70 75 79—80 106 160.163 174 176 178 180 380—381 390—392 418—419 428—429
Bern, M. 419
Bernstein — Bezier surface 368
Berra, P.B. 432
Besslich, P.W. 419
Bestul, T. xii
Bezier methods 227
Bhaskar, S.K. 419
Bhetanabhotla, M.N. 435
Bier, E.A. 393 438
Bieri, H. 419
Big O notation x
BIGMIN 108
Bilmes, J. 223 432
Binary image 2
Binary image tree 23 (also see “Bintree”)
Binary search tree 44 73—74 106—107 150
Binary Searchable Polygonal Representation see “BSPR”
Binary space partition tree see “BSP tree”
Binary tree see “Binary search tree”
Bintree 23 26 329 336
BIN_COMPARE 204
Biquadratic patches 330
Bit concatenation 705 109
Bit interleaving 705 105—110 113 133 150 319
Bit interleaving, partial match query 110
Bit interleaving, range query 107—110
bit manipulation 297
Bitmap representation 44—45
BLACK_CSG_NODE 346
Blinn, J.F. 438
BLISS 412
Block classification 337
Bloomenthal, J. 419
Blum, H. 5 419
bnode 202
Boissonnat, J.D. 231 319 367 370 428
Bolour, A. 419
Bonfatti, F. 419
Boolean Query 44
Boolean queryk-d tree 79
Boolean querypoint quadtree 65
Border 2
Borgefors, G. 419
Bottom-up quadtree construction 4
Bouatouch, K. 417 448
Boundary 2 2—3
Boundary model (BRep) 316 318 329 331—338
Boundary node 33 335
Boundary-following algorithms 238
Bounds array 79 198
Bowyer, A. 420
Braid, I.C. 332 420
Brassel, K.E. 437
Bresenham, J.E. 420
Bright, S. 420
Brock, P.J. 423
Brodatz, P. 420
Brooks, J. 420
Brooks, R.A. 11 420
Brown, R.L. 420
Brunet, P. 328—330 403 417 420 444
BSP tree (binary space partition tree) 25 25—26 67 223
BSPR (Binary Searchable Polygonal Representation) 232 232—234
Bucher, W. 163 420
Bucket 43 47 264
Bucket adaptive k-d tree 113
Bucket merging, EXCELL 145
Bucket merging, grid file 139—140
Bucket overflow 48
Bucket PR k-d tree 111 113 116 145—146
Bucket PR quadtree 111 265—267 319
Buddy system 118 139
Burkhard, W.A. 107 120 420
Burnett, B. xii
Burrough, P.A. ix 420
Burt, P.J. 13 21 420
Burton, W. 232 396 420—421
Butz, A.R. 15 421
C 202
C programming language x 411 413
Calkins, H. 312 441
Callen, M.J. 442
Cameron, S.A. 355 421
Candidate node 55—64
Cantor-diagonal order 75
Capacity 117
Carlbom, I. 328—329 421
Carlson, W.E. 368 421
Carpenter, L. 423 438
Carson, S. xii
Cartesian product 155 187
Cartographic anomaly 153
Cartography ix
Caspary, E. 421 454
Catmull, E. 421
Cavazza, L. 419
Cavity 316
CCQUAD 59
Cebrian, J.A. 441
Cell decomposition 318
Cell method 46 (also see “Fixed-grid method”)
Cell tree 223
Center 242
Centroid 155
Chain 295
Chain 2—3 tree 277
Chain code 312 355
Chain tree 296
CHAIN_ID 304
Chakravarty, I. 328 421
Chan, K.C. 421
Chandran, S. xii
Chang, J.M. 421
Channel finding 157
Characteristic parts 155
Chaudhuri, B.B. 421
Chazelle, B. 166 297 421
Checkerboard 32
Chelberg, D. 422 448
Chen, C. 421
Chen, H.H. 421
Chen, L.S. 422
Chen, S.S. xi
Chen, Y.C. 27 374 422
Chen, Z.T. 23 368 422 458
Cheng, S.F. 460
Chestek, R. 422
Chiarulli, D.M. 442
Chien, C.H. xii 320—322 325—326 403 422
Chien, Y.T. xi
Chrisman, N. 312 366 448
Chu, J.-H. xii 379 387 422
CIF_COMPARE 203
CIF_DELETE 207
CIF_INSERT 204
CIF_SEARCH 209
Circuit extraction 157
Circuit extraction, quadtree 218
Circuit extraction, RR quadtree 217
City block distance 75
City block metric 56
Cityline Map 278
Clark, J.H. 422
CLASSIFY_VOXEL 351
Clay, R.D. 422
Clear, R.D. 460
Cleary, J.G. 422
Clemmesen, M. 359 423
CLIP_LINES 244
CLIP_SQUARE 243
Cluster 115
Clustered data 100 105 109 132
cnode 202
Cohen, E. 227 365 423
Cohen, J. 339 423
Cohen, M.F. 423 434
Реклама