Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Samet H. — The design and analysis of spatial data structures
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.


Язык: en

Рубрика: Computer science/Алгоритмы/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1990

Количество страниц: 493

Добавлена в каталог: 22.11.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Otheraxis      207
Otoo, E.J.      141 443
Ottliczky, F.M.      461
Ottmann, T.      107 160 176 390 419 447
Ouksel, M.      107 120 141 447 454
Ousterhout, J.K.      157 193 393—394 447
Outer approximation      29 31
Overflow bucket      118
Overlap, R-tree      220
Overlapping pyramid      13
Overlay      336—337
Overmars, M.H.      ix 45 53 62 70 72 158
Overwork      65
Ozkarahan, E.A.      447
O’Rourke, J.      x 114—115 393 427 446
p1      242
P2      242
Packed R-tree      113 222 224
Palimaka, J.      447
Papert, S.      443
Parallel data structure      80
Parallel projection      337
Parallel projection, oblique      321
Parallel projection, orthographic      321
Parametric space      330
Parent segment      269
Park, C.M.      447
Partial match query      105 139
Partial match query, bit interleaving      110
Partial match query, k-d tree      80 382
Partial range query      see “Partial match query”
Partial range query, k-d tree      79
Partial range query, point quadtree      65
Pascal      x 411—412
Path planning      330
Patnaik, L.M.      444
Patrick, E.A.      15 447
Pattern matching      13
Pattern recognition      vii 10
Pavel, M.      25 423 457
Pavlidis, T.      6 12 115 433 458
Peano — Hilbert order      14 14—15 378 384
Peano, G.      14 106 447
Pearson, G.      xii
Penrose, R.      10 423
Perfect k-d tree      80
Perfect point quadtree      65
Perimeter      27 31—37
Perimeter, collections of small rectangles      178 184
Perimeter, polygonal map      251
Persistent search tree      176
Perucchio, R.      11 369 436
Peters, R.      447
Peucker, T.      228 230 234 312 366 440 448
Peuquet, D.      ix 23 312 441 448 456
Pfaltz, J.L.      5 448 450
phasing      112—113 775 267
Philip, G.M.      293 319 461
Phong, B.T.      448
Piano movers problem      11
Pienovi, C.      367 424
Pietikainen, M.      13 448
Pippenger, N.      107 112 117 139 141 427
Pixel      7
Plan      11
Plane-sweep methods      755 158—186
Platonic solids      23
Platzman, L.K.      388 418
Plowing      157
PM octree      326—330 527
PM octree, set-theoretic operations      329
PM quadtree      216 239—286 307—308 310—311
PM-CSG tree      330 360—365 361
PM-RCSG tree      364
PM1_CHECK      245
PM2_CHECK      259
PM3_CHECK      262
PMR quadtree      264—268 272 285—286
PMR-f quadtree      272 272—275
PM_delete      247
PM_insert      244
Point      157 242
Point data      43—151
Point dominance problem      175
Point location problem      viii-ix 276 287
Point location problem, $PM_1$ quadtree      306—307
Point location problem, $PM_2$ quadtree      306
Point location problem, $PM_3$ quadtree      306
Point location problem, gap tree      298—299
Point location problem, K-structure      291
Point location problem, layered dag      302
Point membership, strip tree      230
Point quadtree      8—9 23 48 48—65 149 156 367
Point quadtree, Boolean query      65
Point quadtree, comparison with a k-d tree      80
Point quadtree, comparison with a PR quadtree      104—105
Point quadtree, comparison with an MX quadtree      104—105
Point quadtree, deletion      54—64
Point quadtree, double balance      380
Point quadtree, insertion      49—53
Point quadtree, partial range query      65
Point quadtree, point query      65
Point quadtree, range query      65
Point quadtree, replacement node      55—64
Point quadtree, search      64—65
Point quadtree, shape      104
Point quadtree, single balance      380
Point quadtree, size      104
Point query      44 157 190
Point query, k-d tree      79
Point query, point quadtree      65
Point set query      157
Point-in-polyhedron test      337
POINTER      412
Polar angle      374
Polar coordinates      132—133
Polar quadtree      30 30—31
Pole      21 23
Polyakov, A.O.      15 416
Polygon      156
Polygon arc tree      232
Polygon tree      65
Polygonal map      227
Polygonal tilings      17—26
Polyhedral approximation      370—374
Polytree      328
POLYVRT (POLYgon conVeRTer)      312
Ponce, J.      231 367 370 409 428 448
Population      111
Population model      111
Porter, T.      423 448
Posdamer, J.L.      319 326 448
Positive boundary node      361
POSSIBLE_PM23_MERGE      260
POSSIBLE_PM_MERGE      248
Potmesil, M.      320 448
Powerline Map      278
PR bintree      93 103
PR k-d tree      93 101 107 143 145 149
PR quadtree      16 92 92—103 149 156 202 241 246 261 264 310
PR quadtree, comparison with a point quadtree      104—105
PR quadtree, comparison with an MX quadtree      104—105
PR quadtree, deletion      97—99
PR quadtree, insertion      95—97
PR quadtree, range query      100
PR quadtree, rectangle representation      196—197
PR quadtree, shape      104
PR quadtree, size      104
PR quadtrie      92
Pratt, M.J.      460
Pratt, W.K.      8 448
Predictive quadtree construction      4 319
preload      411
Preparata, F.P.      ix—x 154 158 175 195 286—287 293 366 402 439 445 448
Preprocessing cone      12
Prewitt, J.M.S.      449
Primary bucket      118
Primary key      48 106
Primary structure      166
Prime Meridian      23
Primitive instancing      317 317—318
Prince, H.B.      461
Priol, T.      417 448
Priority search tree      83 83—85 171—174
Priority search tree, range query      83
Priority search tree, rectangle intersection problem      171—174
Prism tree      231 367 370—374
Probe factor      141
Projection image      320
Projection, CSG tree      359
Projection, oblique parallel      321
Projection, orthographic parallel      321
Property sphere      21 26 367
Proximity query      155
Proximity search      64
Prune      350
Pruning      346
PR_COMPARE      94
PR_DELETE      98
PR_INSERT      96
Pseudo k-d tree      72
Pseudo quadtree      62 62—64 70 72
PT_COMPARE      52
PT_DELETE      60
PT_INSERT      52
PT_IN_SQUARE      243
Puech, C.      112 384 428 442 449
Pujari, A.K.      439
Pulleyblank, R.      449
Purtilo, J.      xii
Pyramid      ix 12 115 150 366
Pyramid, overlapping      13
q-edge      240
q-face      328
q-fragment      269
q-fragment, compatible      273
q-fragment, incompatible      274
Q-tree      8
QMAT      see “Quadtree Medial Axis Transform”
Quadrant      4
Quadtree      2
Quadtree medial axis transform (QMAT)      13
Quadtrie      8
Quarendon, P.      449
Quaternary decomposition      366—367 369
Query      44
Quinlan, K.M.      328 338—339 346 449 175 180 184—186 380—383 389 462 447
R-tree      113 219—225
R-tree, coverage      220
R-tree, overlap      220
R-tree, rectangle intersection problem      224
Radix searching      44
Raghavan, V.V.      449
Rahn, F.      420
Ramakrishnan, I.V.      444
Ramamohanarao, K.      120 385 449
Raman, V.      449
Raman, V.K.      418
Ramanath, M.V.S.      417 430
Ranade, S.      449
Random polygon      268
Range data      325
Range image      325
Range octree      325
Range priority tree      84 84—85
Range priority tree, range query      84
Range query      44 44—45 47
Range query, bit interleaving      107—110
Range query, k-d tree      77 79
Range query, MX quadtree      91
Range query, MX-CIF quadtree      210
Range query, point quadtree      65
Range query, PR quadtree      100
Range query, priority search tree      83
Range query, range priority tree      84
Range query, range tree      81
Range search      see “Range query”
Range tree      80—85 163—164 175
Range tree, range query      81
RANGE_TREE      81
Ranging device      325
Rao, P.S.      236 441
Rastatter, J.      xi
Raster-scan order      4 14
Raster-to-quadtree conversion algorithm      218
Ratschek, H.      359 449
Raunio, R.      458
Ravindran, S.      449
Ray      45
Ray tracing      45 365
RBF octant      408
rcsg      364
RDB octant      408
Recognition cone      12
Rect      203
rectangle      202
Rectangle data      see “Collections of small rectangles”
Rectangle intersection problem      viii—ix 158—178
Rectangle intersection problem, $R^+$-tree      224
Rectangle intersection problem, balanced k-d tree      195
Rectangle intersection problem, expanded MX-CIF quadtree      215
Rectangle intersection problem, grid file      196
Rectangle intersection problem, interval tree      165—171
Rectangle intersection problem, MX-CIF quadtree      211
Rectangle intersection problem, point-based methods      192
Rectangle intersection problem, priority search tree      171—174
Rectangle intersection problem, R-tree      224
Rectangle intersection problem, RR quadtree      218
Rectangle intersection problem, segment tree      160—165
Rectangle intersection problem, tile tree      170
Rectangle placement problem      180
Rectangular coding      5
Rectangular grid, for topographic data      366
Rectangular window      65
RECT_INTERSECT      209
Recursive linear hashing      120
Red-black balanced binary tree      173
Reddy, D.R.      11 449
Reddy, P.G.      439
Reference      411
Region 2—3 tree      277
Region data      see “Two-dimensional region data”
Region octree      4 318—326
Region quadtree      3
Region quadtree, curve representation      312
Region quadtree, optimal position      37^1
Region quadtree, point representation      44
Region quadtree, rectangle representation      214 223
Region quadtree, space requirements      32—37
Region quadtree, time to build      217
Region quadtree, translation      33 37
Region tree      295
Region, black      2
Region, boundary      2
Region, eight-connected      2
Region, four-connected      2
Region, white      2
Regnier, M.      112 196 387 449
Regular curve      230
Regular decomposition      2 44
1 2 3 4 5 6 7
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте