Saved
Software · Hardware

Texture mapping

It didn’t make 3D look real—it made 3D look cheap, fast, and editable.

Worth your time?4.5/5Yes.Study the whole thing.What works, what does not, who it is for ↓
9:28in productionCh. 1 · The first trick/ 9:28 · ceiling 15 min
4 chapters · 9:28Ceiling 15:00

The brief is written and checked. The video joins this page when it is cut.4 chapters · 1 min read · 9:28 planned

Read the brief

Texture mapping is the foundational technique that enabled efficient, artist-controlled surface detail in 3D graphics. Its 1974 debut by Edwin Catmull solved the problem of visual richness without geometric bloat—but introduced new problems in sampling accuracy, perspective distortion, and aliasing. It works reliably only when implemented as inverse, perspective-correct mapping. Everything else is either obsolete or broken.

Chapters & takeaways4
  1. 0:47
    The first trick

    It began as diffuse mapping: wrapping flat images around objects, not simulating light or depth.

  2. 2:10
    Why we scan the screen

    Inverse mapping wins: it scans pixels, not texels, avoiding holes and overlaps.

  3. 3:38
    Why screen-space interpolation lies

    Perspective correction requires 3D vertex data—not screen-space math—to avoid warped textures.

  4. 5:44
    The dead end

    Forward mapping fails in practice: texels scatter unpredictably across pixels.

1 more chapterFewer chapters
Worth your time?

Yes. Study the whole thing.

4.5/ 5
What works
  • decoupling appearance from geometry
  • enabling reusable surface assets
  • supporting real-time rasterisation via inverse mapping
  • scaling with hardware acceleration
What does not
  • texture mapping resolves lighting
  • texture mapping handles transparency or reflection
  • texture mapping eliminates aliasing
  • affine interpolation is sufficient for perspective scenes
Study it if
  • graphics programmers
  • GPU architects
  • 3D tool developers
Skip it if
  • UI designers
  • AI model trainers
  • web frontend developers
Who should study it, and who should skipHide who it is for
The written brief1 min read

What it is and the problem it solves

Texture mapping is a technique for projecting 2D image data onto 3D models. It solves the problem of adding surface detail—like brickwork or skin—without modelling every bump or crack as geometry.

How it works

It works by assigning UV coordinates to 3D geometry, then for each screen pixel, tracing into the 3D scene to find which polygon is hit and using the corresponding UV values to sample colour from a 2D texture. Inverse mapping processes per-pixel; forward mapping processes per-texel. Perspective-correct mapping uses 3D vertex positions and 1/z interpolation; affine mapping interpolates linearly in screen space.

What works

Inverse mapping works reliably for rasterisation: each pixel gets exactly one sampled texel (with filtering). Diffuse mapping—its original form—works for flat lighting conditions. Perspective-correct mapping works for accurate texture placement on foreshortened surfaces.

What does not

Forward mapping produces gaps and overlaps on screen because it cannot guarantee every pixel receives a texel. Affine interpolation fails under perspective distortion, causing texture skew on receding surfaces. The method itself does not resolve aliasing, filtering, or mipmapping—those are later additions.

What it changes

It changes how surface detail is represented: from hand-coded shading or procedural patterns to reusable, artist-authored 2D image data mapped onto arbitrary geometry. It decouples appearance from topology, enabling richer visual fidelity without increasing polygon count.

Is it worth your time

Yes—if you work with real-time 3D rendering, GPU pipelines, or graphics software development. It remains foundational, but its core mechanism is now abstracted behind APIs and hardware units; understanding it matters only when debugging visual artefacts or optimising sampling paths.

Same field · Software4 of 114
9:51
JPEGJoint Photographic Experts GroupJPEG is a 1992 DCT-based lossy compression standard. It delivers predictable 10:1 size reduction with acceptable visual trade-offs. It defines only the codec—not the file format. Its lossless mode is unused. It remains dominant not by superiority but by inertia.
8:46
Arista Networks2004Arista Networks restructured the network operating system around process isolation and a central state database. Its value lies not in speed or scale alone—but in making failure local, upgrades safe, and debugging possible. It is a systems-level intervention, not a feature upgrade.
9:48
RedisSalvatore Sanfilippo · 2009Redis is an in-memory key-value database introduced in 2009 by Salvatore Sanfilippo to solve scalability issues at his startup LLOOGG. It delivers low-latency operations by holding all data in memory and using the fork system call to enable concurrent client service and disk persistence. It supports two persistence methods—RDB snapshotting and AOF journaling—with journaling introduced in version 1.1 and considered safer. Default configuration limits data loss to a few seconds upon full system failure. Redis supports master-replica replication with hierarchical trees and introduced clustering in April 2015 with version 3.0. It grew into one of the world’s most popular databases for caching, message brokering, and primary storage. In December 2024, Sanfilippo returned to Redis and implemented the Vector Set data structure for vector similarity search.
9:28
ALGOL1959ALGOL is the first language to define scope, syntax, and semantics as interlocking formal systems—not as implementation conveniences. Its success was in writing, not execution. Its failure was in running.
Up next in Technology

AI data center

· 11:49

AI data centers don’t just run models—they starve the rest of computing of memory.

11:49