Graphics Gems V (IBM Version)

N

Narrow domains, aliasing, II.123–II.124

National Television Systems Committee, encoding basics, II.148–II.152

N-dimensional

distance, IV.120

extent, overlap testing, III.240–III.243, III.527

geometry, IV.149

space, face connected line segment generation, III.460

Nearest neighbor, V.3D, V.65

Nearest-point-on-curve problem, I.607–I.611

Bézier form conversion, I.609–I.611

problem statement, I.608–I.609

Nesting, I.467–I.468

Negative light, III.367

Neumark’s algorithm, V.9

Neutral file format (NFF), V.398

Newell’s method, plane equation of polygon, III.231–III.232, III.517

Newton–Raphson iteration, digitized curve fitting, I.621–I.623

Newton’s Formula, I.14, I.596–I.598

NextFaceAroundVertex, II.195–II.196

Nice numbers, for graph labels, I.61–I.63 ...