Tag Page

procedural modeling

2 sources across the archive use this tag. The list below groups them by source while keeping the original topic context visible.

Back to all tags

Ray Marching

Inigo Quilez, Raymarching SDFs

Also listed on Ray Marching.

Quilez’s article is the most practical bridge between the formal sphere-tracing literature and the way the technique is actually used in shader culture. Rather than stopping at the generic march-until-hit loop, it shows ray-marched SDFs as a complete creative workflow: scene construction in code, smooth blends, repetition, deformation, shading, shadows, and iteration toward final images. That is why it remains so influential for practitioners: it teaches the method as a living medium for procedural scene-building, not just as an intersection routine.

Another reason it is distinctive is historical and aesthetic. The article places modern SDF ray marching in a lineage that includes older implicit-surface work while also documenting the demoscene and Shadertoy style that made the technique widely legible to graphics programmers. The result is a reference that is less formal than Hart but far richer in modeling intuition, especially if you want to understand why repetition, domain distortion, and compact signed-distance code became central patterns in realtime procedural rendering.

Ray Marching

Inigo Quilez, Distance Functions

Also listed on Ray Marching.

This article is effectively the working vocabulary of procedural SDF modeling. Instead of focusing on one renderer or one derivation, it collects distance formulas for primitives, modifiers, and operators in a form that can be dropped directly into shader code. For anyone building scenes, this is the page that turns the abstract idea of signed distance modeling into an extensible parts library: boxes, capsules, tori, repetitions, extrusions, smooth unions, and many other ingredients all presented in a compact, composable style.

What makes it particularly valuable is that it distinguishes between exact distance fields and conservative bounds. That distinction is easy to skip in beginner material, but it is crucial for understanding why some formulas march more reliably than others and why a locally cheaper approximation can create a worse global result by degrading step quality. In other words, Quilez is not just listing formulas; he is teaching the practical contract between modeling code and the marcher that consumes it.