Авторизация
Поиск по указателям
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
Предметный указатель
Regular prism tree 374
Regular tessellation 18
Regular tiling 17
Regularization 294 364
Regularized Boolean set operations 341
Reingold, E.M. 109 387 449
Reiser, J.F. x 411 449
Rekola, P. 359 416 458
Remington, J. xii
Replacement node, k-d tree 73—74
Replacement node, point quadtree 55—64
Representative point 155 186
Requicha, A.A.G. ix 186 338—339 341 345 403 439 450 460
Resolution 2
Resolution, multiresolution ix 12
Resolution, variable ix 3
Restricted quadtree 369 376
RETURN_TREE_TO_AVAIL 248
Reversed bit interleaving 120 124 130 133 146 385
Revised line quadtree 238
Reynolds, R.A. 422 431
Rheinboldt, W.C. 11 450
Rhodes, M.L. 437
Riesenfeld, R. 227 365 423
Right 81 242 304 341
Rinnooy-Kan, A.H.G. 15 439
Riseman, E.M. 12 450
Ritchie, D.M. x 411 436
Roadline Map 278
Robinson, J.T. 106 113 222 450
Robotics vii 10 11 231 315 330
Rogers, D.F. 240 321 369 403 450
Rokne, J. 359 449
Ronse, C. 450
root node 4
Rosenberg, J.B. 194 394 450
Rosenfeld, A. ix—xi 5 13 33 40 100 161 278 280 419—420 425—426 438 447—453 462
Rosette 21
Rossignac, J.R. 339 450
Rotation hierarchy 19
Rotation, quadtree 310
Rotation, quadtree 310
Rotation, balancing a binary tree 72
Rotation, cone tree 376
Rotation, sector tree 31
Rotational sweep 317 332
Roth, S.D. 319 339 451
Roussopoulos, N. 13 113 222—224 384 424 427 451 455
Row order 4 14
Row-prime order 14
RR quadtree 216—217
RR quadtree, circuit extraction 217
RR quadtree, electrical connectedness 217
RR quadtree, rectangle intersection problem 218
RUB octant 408
Rubin, S. 11 449 451
Rubinstein, F.M. 460
RUF octant 408
Ruff, R. 451
Runlength representation 5 36 92
Running-sum worst-case cost 250
Russell, D.B. 412 462
Rutovitz, D. 5 451
Saalfeld, A. xi 293 319 451
Sacks-Davis, R. xii 113 120 197 199 385 446 449
SAIL x 411
Sakauchi, M. 101 444—445 451
Salzberg, B. 101 440 451
Salzman, J. xii
Samet, H. viii—ix xi 4 8 11 23 33 40 54 61—63 100 111—112 211 237 239 252 254—255 265 267—269 272 278 280 308 311 319 329—330 339 353—355 364 381 398 400 402 404—405 416 425—426 429 438 444—445 449 450—455 458
Sandor, J. 454
Sands, M. 428
Sankar, R. 444
Sarnak, N. 176 425 454
Sasikumaran, S. 435
Satoh, T. 337 438
Satterthwaite, E. x 411 418
Saxe, J. 387 419 454
Scaling, cone tree 376
Scaling, sector tree 30
Scherson, I.D. 454
Scheuermann, P. 107 120 141 447 454
Schilling, W. 432
Schmitt, F. 368 454
Schumacker, R.A. 2 44 457
Schwartz, J.T. 11 454
Scott, D.S. 5 454
SE quadrant 4 (also “Corner vertex”)
Search, k-d tree 77—80
Search, point quadtree 64—65
Secondary key 48 106
Secondary structure 167
Sector tree 27 27—31 374 376
Sector tree, intersection 30
Sector tree, rotation 31
Sector tree, set-theoretic operations 30
Sector tree, translation 31
Sector tree, union 30
Sedgewick, R. 173 431 454
Seeger, B. 438 454
Segment tree 160—165 183—184
Segment tree, building an octree from range data 325
Segment tree, rectangle intersection problem 160—165
Segmentation 6
Seidel, R. 393 427
Sellis, T. xii 222—224 427 455 457
Semi-infinite range query 83 173 389
Semiclosed 158
Separating chain 293—299 295
Separator 295
Septree 21
Sequential list 46 149
Sequin, C. 393
Serial data structure 80
Set-theoretic operations vii
Set-theoretic operations, cone tree 376
Set-theoretic operations, MX-CIF quadtree 210
Set-theoretic operations, PM octree 329
Set-theoretic operations, sector tree 30
Set-theoretic operations, solids 317
Set-theoretic operations, strip tree 230
Sevcik, K.C. 44 135 139—140 445
Shacter, B.J. 77 439
Shading 16 369
Shaffer, C xii 4 8 33 40 100 216 219 252 254—255 278 280 319 395 398 416 447 450—453 455
Shamos, M.I. ix 154 158 195 286—287 366 389 448 455
Shand, M.A. 194 455
Shankar, P. 459
Shapira, R. 395 429
Shapiro, E. 426
Shapiro, L. 441
Share_PM1_vertex 245
SHARE_PM2_VERTEX 259
SHARE_PM3_VERTEX 263
Sharir, M. 11 454
Shell 331 333
Shephard, G.C. 18 431
Shephard, M.S. 11 463
Sherlekar, D. xii
Shifting see “Translation”
Shigei, Y. 437
Shimizu, K. 445
Shirai, Y. 364 409 462
Shmoys, D.B. 15 439
Shneier, M. 13 210 235 320—321 433 436 449 455
short-circuit evaluation 411
Shpitalni, M. 427 456
Shuffle order 107
Shustek, L.J. 46 380 429
Siegel, A. 454
Sign language 91
Silhouette 91 320—321 323—324 326
Silva Filho, Y.V. 456
Silva, C. 332 456
Sim, Y.B. 325—326 403 422
Similar tiling 17
Simple polygon 33
Simple section 232
Single balance, point quadtree 380
Six, H.W. 163 434 456
Slab 181
Sleator, D.D. 118 176 250 418 425
Sloan, K.R.Jr. 114—115 446 456
Smeulders, A.W.M. 425
Smith, J.L. 199—200 415
Smith, T. xii 429 443 456
Snyder, J.M. 456
Sobhanpanah, C. 456
Solid modeling vii ix 11 315—318 329
Solid tile 193
Solntseff, N. 456
Sommerville, D.M.Y. 456
Son 49 66 87 93 203 242
SONTYPE 49 66
Sorenson, P.G. 101 384 424
Sotomayor, D.L.G. 367 456
Space planning 10
Space tile 193 198
Space-filling curve 14
Space-ordering methods 13
Sparrow, E.M. 458
Sparse matrix 91—92
Spatial database vii
Spatial enumeration 318
Spatial index vii 10 318
Spatial k-d tree 113 197 199
Speer, L.R. 456
Sperling, G. 457
Spheres 330
Spherical triangle 21
Spiral 31 135
Spiral hashing 125—131 150
Spiral order 75
Split step 6
Split step, polyhedral approximation 371
Split-and-merge segmentation algorithm 6 13
Splitting point 228
Splitting threshold 265
Splitting, MX quadtree 55
Splitting, MX-CIF quadtree 204
Splitting, PR quadtree 95
SPLIT_PM_NODE 245
Sproull, R.F. 2 44 457
Square 242
Square grid 21
Srihari, S.N. ix 11 320 330 403 432 457 463
Srivastava, S.K. 321 457
Stabbing counting query 765
Stabbing query 765 177 391
STACK 412
Staircase 108
Stanat, D.F. 47 62 65 380 419
Standard deviation 6
Stanley, M. xii
static data 43
Static interference detection 355 355—356
Steele, R. 434
Steiglitz, K. 11 32—34 91 210 236 353 369 400 434
Steinberg, H.A. 420
Stenstrom, J.R. 457
Stevens, A. 434
Stolfi, J. ix 166 287 293 297 299 401—402 427 441
Stonebraker, M. 222 457
Storage utilization factor 775
Stout, Q.F. 443 455
Strassen's recurrence 383
Strassen, V. 383 457
Streaming 184
Strip tree 225 228—234 237 312—313 372—373
Strip tree, curve intersection 230
Strip tree, point membership 230
Strip tree, set-theoretic operations 230
Strong, H.R. 107 112 117 139 141 427
Stroud, I.A. 332 420
Superkey 66 72 76 79
Surface area 36
Surface data 365—376
Surface triangulation 319
Sutherland, I.E. 2 44 457
Sutherland, R.J. 339 435
SW quadrant 4 (also “Corner vertex”)
Sweep 321
Sweep methods 317 317—318
Swensen, J. 425
Swonen, R. 441 457
Symmetric structure 332—333
Tabakman, Z. 430
Tactile recognition 231
Takagi, M. 437
Tamminen, M. xi 11 23 100 107 112 120 139 141 150 211 264 319 328—330 334 336 339 344 353—355 404—405 435 438 441 453 457—458
Tanaka, T. 330 429
Tang, Z. 458
Tangential intersection 353
Taniguchi, R.I. 436
Tanimoto, S. ix 11—13 115 330 434 456 458
Tarjan, R.E. 118 173 176 250 286—287 387—389 418 425 440 449 454 458
Telephonic transmission 91
Ternary decomposition 366—367 369
Tertiary structure 765
Test compression 101
tetrahedron 23
Teuber, M.L. 10 423
THEN 412
Thibault, W.C. 458
Thomas, A.L. 339 458
Three-dimensional data see “Volume data”
Threshold 6
TID 5
Tikkanen, M. 359 416 458
Tile tree 766 170 201—202
Tile tree, rectangle intersection problem 170
Tilove, R.B. 346 354 364 458
Time dimension, incorporating into constructive solid geometry (CSG) 355—360
Tin see “Triangular Irregular Network”
Tobler, W. 23 368 422 458
Tokarcik, L. xi
Tong, L. xii
Top-down quadtree construction 4
Topographic data 366
Topological entity 331
Topological sort 295
Topologically valid boundary model 332
Torborg, J.G. 425
Toriya, H. 20 322 324 429 463
Torrance, K.E. 423 431 458
Total path length (TPL), quadtree 398
Total path length (TPL), k-d tree 69 72 75
Total path length (TPL), point quadtree 52 62—63
Toussaint, G.T. ix 228 276 286 459
TPL see “Total path length”
Trajectory 356
Translation, quadtree 310
Translation, quadtree 310
Translation, cone tree 376
Translation, halfspace 356
Translation, region quadtree 33 37
Translation, sector tree 31
Translational sweep 317 332
Trapezoidal tiling 18
Traveling salesman problem 75 16
Реклама