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

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

blank
blank
blank
Красота
blank
Paeth A.W. (ed.) — Graphics gems (volume 5)
Paeth A.W. (ed.) — Graphics gems (volume 5)

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Graphics gems (volume 5)

Автор: Paeth A.W. (ed.)

Язык: en

Рубрика: Computer science/Вычислительная геометрия/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
"Inside-outside" function, superquadrics      147 III.148
$3 \times 3$ matrix, zero structures for      II.358-II.359
$4 \times 4$ matrices      II.351-II.354
$A$-buffer      I.76
$C^{1}$ joint, between cubic B$\acute{e}$zier curves      II.532
$Del$ operator      IV.94-IV.95 IV.98
$G^{2}$ joint, between cubic B$\acute{e}$zier curves      II.532
$InputFace$      III.96
$InputVertex$      III.96
$InsertBridge$      III.99 II.201
$N = 2$      III.67-III.68
$N = 24$      III.75 III.76
$N = 3$      III.68 III.70
$N = 3, 4, 6$      III.70 III.71
$N = 6$ derivation      III.71 III.73
$N = 6$ triggering      III.73 III.74
$N = 7$      III.7 4 III.7 5
$N$-dimensional distance      IV.120
$N$-dimensional extent, overlap testing      III.240 III.243 III.527
$N$-dimensional geometry      IV.149
$N$-dimensional space, face connected line segment generation      III.560
$n$-gon      II.8
$NextFaceAroundVertex$      II.195 III.96
$Octree-to - Boundary$ conversion      II.214-II.218
$Octree-to - PCS$      II.214-II.215
$PCS-to - Chain$ procedure      II.205-II.206
$Quadtree-to - PCS$      II.211 II.213
$RGB-to - YIQ$ encoding      III.51
$SetWings$      II.194-III.95
$Shape-box$ routine      II.50 II.51
$SplitEdge$      III.97-III.98
$Top - Down$      II.206-II.208 II.210
$U$, $V$ values      II.26l II.262
$WEdgeData$ structure      III.92-III.94
$X$-transition table      I.93 I.95
$Y$ extrema, polygon fast scan conversion      I.95-I.96
$Z$-buffered triangle, scanline depth gradient      I.361-I.363
1-to-1 pixel transforms      II.96-I.209
1-to-1 pixel transforms, color-map manipulation      I.270-I.274
1-to-1 pixel transforms, contrast enhancement transform      II.97-II.98 I.202 I.270-I.271 I.274
1-to-1 pixel transforms, gamma correction function      II.99 I.203-I.206 I.273
1-to-1 pixel transforms, null transform      II.96-II.97
1-to-1 pixel transforms, photo-inversion transform      II.96 II.98 I.270-I.271
1-to-1 pixel transforms, quantization transform      II.96-II.97 II.99 I.272
1-to-1 pixel transforms, sawtooth transform function      I.203 I.207-I.209
2 1/2 - D Depth-of-field simulation, computer animation      III.36-III.38
Absorption coefficient      II.279-II.280
Absorption index      II.280
Active edge list      I.92-I.93
Adaptive clustering (halftoning)      V.302
Adaptive image refinement      V.355
Adaptive meshing, radiosity, shadow boundary detection      II.311-II.315
Adaptive prediction-correction coders      II.94-II.95
Adaptive subdivision, of surface      IV.287
Addresses, precalculating      I.285-I.286
Adjacent facets, normals      II.239
Adjoint matrices      IV.38
Affine matrix group      II.345
Affine matrix, inverse      II.348-II.349
Affine modeling transformations, normal vectors      IV.39-IV.42
Affine transformation      see also Transformation
Affine transformation, decomposing      III.116
Affine transformation, unit circle inscribed in square      III.170
Aggregate objects      II.264
Albers equal-area conic map projection      I.321-I.325
Algebra      see Matrix; Vector
Algorithm, Bresenham      see Bresenham's algorithm
Algorithm, Bresenham, exact clipping      317
Algorithm, Bresenham, inverse      338
Algorithm, Cohen - Sutherland      V.315
Algorithm, de Boor      V.217
Algorithm, de Casteljau      V.199 V.217
Algorithm, Descartes - Euler - Cardano      V.8
Algorithm, Ferrari      V.7
Algorithm, Neumark      V.9
Algorithm, Seidel      V.394
Algorithm, Sutherland - Hodgman      V.51
Aliasing, narrow domains      III.23-III.24
Alpha blending      I.210-I.211
Alpha buffer      I.218
Alpha compositing operators      I.211
Alternating Bresenham edge-calculator      III.350 III.351
Altitudes, triangles, intersection      I.22
Ambiguous face      V.99
Angle subdivision      see Ellipsoid generation
Angle-preserving matrix group      II.345
Angles, encoding, bit patterns      IV.42
Angles, not uniform      III.128 III.129
Angles, subdivision      see Ellipsoid generation
Angles, sum and difference relations      II.6
Animation morphing      IV.445
Animation recording      I.265 I.269
Animation recording, double-framed order      I.265-I.266
Animation two 1/two - D depth-of-field simulation      III.36 III.38
Animation, camera control      IV.230
Animation, collision detection      IV.83
Anti-aliased circle generation      II.545-II.549
Anti-aliased lines, rendering      II.05-II.06
Anti-aliasing      I.37 IV.370 IV.445
Anti-aliasing filters      II.53
Anti-aliasing filters, common resampling tasks      II.57-II.65
Anti-aliasing filters, common resampling tasks, box filter      II.59
Anti-aliasing filters, common resampling tasks, choices of filters      II.58
Anti-aliasing filters, common resampling tasks, comparative frequency responses      II.61
Anti-aliasing filters, common resampling tasks, comparison of filters      II.51-II.52
Anti-aliasing filters, common resampling tasks, continuous, sampled, and discrete signals      II.57
Anti-aliasing filters, common resampling tasks, decimation      II.57-II.58
Anti-aliasing filters, common resampling tasks, decimation, with Lanczos2 sine function      II.60-II.61
Anti-aliasing filters, common resampling tasks, Gaussian 1/two filter frequency response      II.63
Anti-aliasing filters, common resampling tasks, Gaussian filter      II.50-II.53
Anti-aliasing filters, common resampling tasks, half-phase filter frequency response      II.62-II.63
Anti-aliasing filters, common resampling tasks, interpolation      II.57-II.58
Anti-aliasing filters, common resampling tasks, interpolation, by factor of two with Lanczos2 sine function      II.58-II.59
Anti-aliasing filters, common resampling tasks, interpolation, with Gaussian 1/$\sqrt{2}$ filter      II.54-II.56
Anti-aliasing filters, common resampling tasks, interpolation, with Gaussian 1/two filter      II.52-II.54 II.56
Anti-aliasing filters, common resampling tasks, Lanczos-windowed sine functions      II.56-II.58
Anti-aliasing filters, common resampling tasks, Lanczos2 sine functions frequency response      II.64-II.65
Anti-aliasing filters, common resampling tasks, sine function      II.56-II.57
Anti-aliasing filters, common resampling tasks, tent filter      II.59-II.50
Anti-aliasing filters, common resampling tasks, zero-phase filter frequency response      II.62
Anti-aliasing filters, cone plus cosine      II.55-II.56
Anti-aliasing filters, Gaussian filter      II.54-II.55
Anti-aliasing filters, minimizing bumpy sampling      II.54-II.56
Anti-aliasing, advanced, algorithm      II.94-II.95
Anti-aliasing, combining spatial and temporal      III.376 III.378
Anti-aliasing, edge and bit-mask calculations      III.345 III.354 III.586
Anti-aliasing, pixel      I.73
Anti-aliasing, polygon scan conversion      I.76-I.83
Anti-aliasing, triangular pixels      III.369 III.373
Apollonius problem, solution      203- 209
Apollonius problem, solution, 10th problem      II.19-II.24
Apple patent      II.31-II.32
Approximation      IV.241
Arcball      IV.175
Archimedean solids, semi-regular      III.77
Archival media      III.65
Arcs, chord subdivision, nonuniform      V.171
Arcs, chordal deviation      V.169
Arcs, circular      V.168
Arcs, de Casteljau subdivision, variant      V.174
Arcs, radius of curvature      V.168
Arcs, vertex deviation      V.170 V.174
Arctangent, approximation      II.389-II.391
Area of intersection, circle and half-plane      I.38-I.39
Area of intersection, circle and thick line      IV.0-IV.2
Area of intersection, two circles      IV.3-IV.6
Area, computing, binary digital image      III.07-II.111
Area, planar polygon      IV.3 IV.141
Area, polygon      II.5-II.6 V.35
Area, quadrilateral      V.37
Area, spherical polygon      IV.132
Area, spherical triangle      V.44
Area, triangle      I.20 IV.140 IV.161
Area, vectors      V.35
Area-to-differential-area form factor      II.313
ARIES technique (halftoning)      V.303
Arithmetic complex      IV.139
Arithmetic exponentiation      IV.385 IV.403
Arithmetic floating point      IV.125 IV.422
Arithmetic integer      IV.123 IV.449 IV.526
Asymmetric filter      II.52-II.53
Autumn terminator      II.540-II.541
Axes, transforming      IV.56-IV.59
Axial deformation      V.139
Axis-aligned bounding boxes, transformation      IV.48-IV.50
Axis-amount representation, conversion with matrix      IV.66-IV.67
Azimuthal equal-area projection      I.317
Azimuthal equidistant projection      I.316-I.317
Azimuthal projections      I.314-I.317
B$\acute{e}$zier control points, derivation      II.377
B$\acute{e}$zier curve-based root-finder      IV.08-IV.15
B$\acute{e}$zier curve-based root-finder, bounding box      IV.13-IV.14
B$\acute{e}$zier curve-based root-finder, conversion to Bernstein-B$\acute{e}$zier form      409-IV.11
B$\acute{e}$zier curve-based root-finder, finding roots      IV.11-IV.15
B$\acute{e}$zier curve-based root-finder, root-finding algorithm      IV.12-IV.13
B$\acute{e}$zier curves and surfaces      I.613-I.616 412-II.516 IV.256 IV.261
B$\acute{e}$zier curves and surfaces, arc length of      V.199
B$\acute{e}$zier curves and surfaces, blossoms of      V.191 V.215
B$\acute{e}$zier curves and surfaces, control polygon      V.204
B$\acute{e}$zier curves and surfaces, de Boor points      V.194
B$\acute{e}$zier curves and surfaces, de Casteljau Evaluation Algorithm      IV.87-IV.89
B$\acute{e}$zier curves and surfaces, derivative formulas      II.529
B$\acute{e}$zier curves and surfaces, differentiation      IV.89-IV.90
B$\acute{e}$zier curves and surfaces, fitting to digitized curve      I.616-I.624
B$\acute{e}$zier curves and surfaces, Gaussian quadrature      V.199
B$\acute{e}$zier curves and surfaces, identities of Bernstein basis functions      V.149
B$\acute{e}$zier curves and surfaces, in terms of Bernstein polynomials      613 I.614
B$\acute{e}$zier curves and surfaces, interpolating form, linear      V.213
B$\acute{e}$zier curves and surfaces, interpolation using      III.133 III.136
B$\acute{e}$zier curves and surfaces, interpolation using, code      III.568
B$\acute{e}$zier curves and surfaces, interpolation using, implementation      III.136
B$\acute{e}$zier curves and surfaces, interpolation using, numeric solution      III.134
B$\acute{e}$zier curves and surfaces, interpolation using, symbolic solution      III.134 III.135
B$\acute{e}$zier curves and surfaces, knot insertion      V.194
B$\acute{e}$zier curves and surfaces, least-squares approximations      II.506
B$\acute{e}$zier curves and surfaces, monomial evaluation algorithm      IV.90-IV.91
B$\acute{e}$zier curves and surfaces, multivariate approximation      II.509-II.511
B$\acute{e}$zier curves and surfaces, notation      IV.87
B$\acute{e}$zier curves and surfaces, parametric surface      IV.278 IV.290
B$\acute{e}$zier curves and surfaces, parametric versus geometric continuity      430-II.531
B$\acute{e}$zier curves and surfaces, properties      IV.87-IV.93
B$\acute{e}$zier curves and surfaces, rendering of      V.206
B$\acute{e}$zier curves and surfaces, smooth connection      V.191
B$\acute{e}$zier curves and surfaces, subdivision, parametric      see de Casteljau algorithm
B$\acute{e}$zier curves and surfaces, univariate approximation      II.506 II.508
B$\acute{e}$zier curves and surfaces, vertex deviation      V.174
B$\acute{e}$zier curves, arc length of      199
B$\acute{e}$zier curves, blossoms of      191 215
B$\acute{e}$zier curves, control polygon      204
B$\acute{e}$zier curves, de Boor points      194
B$\acute{e}$zier curves, Gaussian quadrature      199
B$\acute{e}$zier curves, identities of Bernstein basis functions      149
B$\acute{e}$zier curves, interpolating form, linear      213
B$\acute{e}$zier curves, knot insertion      194
B$\acute{e}$zier curves, rendering of      206
B$\acute{e}$zier curves, smooth connection      191
B$\acute{e}$zier curves, subdivision, parametric      see de Casteljau algorithm
B$\acute{e}$zier curves, vertex deviation      174
B$\acute{e}$zier form, conversion      I.609 I.611
B$\acute{e}$zier form, conversion, from monomial form      IV.91 IV.92
B$\acute{e}$zier form, conversion, to monomial form      IV.92 IV.93
B$\acute{e}$zier simplices      II.512
B$\acute{e}$zier triangles, conversion to rectangular patches      256- 261 III.536
B-spline curves      IV.252
B-spline curves, de Boor algorithm      V.217
B-spline curves, divided difference interpolation      V.213 V.217
B-spline curves, identities of basis functions      V.163
B-spline curves, non-uniform rational      IV.256 IV.286 V.216
B-spline curves, smooth connecting      V.191
B-splines      II.377-II.378
B-splines, cubic, knot insertion      II.525 II.527
B-splines, parametric surface      IV.286
Back to front polygon rendering      V.126
Back-face culling      127
Backface culling      I.346-I.347 IV.44-IV.45 V.127
Banding      I.263
Bartlett filter      III.13 III.15
Barycentric coordinates      IV.162
Bernstein basis      II.506 II.509
Bernstein basis functions      V.149
Bernstein basis functions, integration      I.604-I.606
Bernstein polynomials      I.613-I.614 II.507 II.510 II.528
Bernstein-B$\acute{e}$zier, equation conversion to      IV.11
Beta function, integral form      III.150 III.151
Betacam      III.54
Beveling      II.07-III.3
Bias function      IV.401
Bidirectional reflectance distribution function      V.285
Bilinear interpolation      see Interpolation
Binary digital image      III.07
Binary digital image, computing area, circumference, and genus      II.107-II.111
Binary digital image, computing area, circumference, and genus, algorithm      II.109-III.11
Binary digital image, computing area, circumference, and genus, method      III.07-III.09
Binary order, animation recording      I.266-I.269
Binary recursive subdivision, ray-triangle intersection      II.257-II.263
Binary space partitioning tree      III.226 V.121-V.138
Binary space partitioning tree, ray tracing with      III.271 III.274 III.538
Binary space-partitioning trees      121
Bisection, Strum sequences      IV.20 IV.21
Bit arithmetic      see also Element exchanging
Bit arithmetic, bit rotation (tables)      II.84
Bit arithmetic, counting under a mask      II.372
Bit arithmetic, finding first on bit      II.366 II.374
Bit arithmetic, palindrome generation      II.369
Bit arithmetic, power of two, test      II.366
Bit arithmetic, reading a write-mask      I.219
Bit arithmetic, tallying on/off bits      II.374-II.376
Bit-mask calculations      III.352 III.354 III.586
BitBLT      IV.486
BitBlt, generalized, algorithm      II.93 II.94
Bitmap      IV.466 IV.486
Bitmap rotator 90-degree      II.84 II.85
Bitmap, black-and-white, compositing      III.34 III.35
Bitmap, scaling operations, optimization      III.17 III.19 425
Bitmap, stretching      III.5III.7 III.511
Bits, conversion with digits      IV.35
Bits, interleaving, quad- and octrees      IV.43 IV.47
Bits, patterns, encoding angles      IV.42
Black-and-white bitmaps, compositing      III.34-III.35
Blobby model      IV.324
Blue scanlines, adjusting minimum and maximum      122-III.23
Blue-green plane, domain      III.20-III.22
Blur      see Image filter
Body centered cubic lattice (bcc)      68 (see also Truncated octahedron)
Body color model      II.277 II.282
Body color model, theoretical basis      II.277 II.278
Bottom - Up      II.206 II.208-II.209
Boundary generator, composited regions      39 III.53 III.541
Bounding box      IV.26 IV.74
Bounding box, axis-aligned, transformation      IV.48-IV.50
Bounding box, fifth-degree polynomial      IV.13-IV.14
Bounding box, radiosity      II.304 II.305
Bounding method, torus      II.254-II.255
Bounding sphere      I.301-I.303
Bounding volume algorithm, linear-time      III.301 III.306
Bounding volume algorithm, worst case      III.302
Bounding volumes, ccube      III.295-III.296
Bounding volumes, clinear-time simple      III.301 III.306
Bounding volumes, cone      III.297
Bounding volumes, cpolygon      III.296
1 2 3 4 5 6 7 8 9
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2018
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте