mcpField
G
game-sdf-and-field-modeling

game-sdf-and-field-modeling

github.com/lvtd-llcDevelopment159 installsUpdated 8w ago
Repository

About game-sdf-and-field-modeling

A skill for game developers and game-building agents modeling gameplay or content as scalar, vector, or signed-distance fields instead of explicit triangles. It covers field composition, transforms, distance validity, and ways to turn fields into gameplay or renderable data.

Key features

  1. 01Scalar, vector, and distance fields
  2. 02Boolean and smooth field composition
  3. 03Transforming samples into local space
  4. 04Rules for preserving distance validity
  5. 05Field sampling and visualization guidance

Use cases

  1. 01Modeling procedural rocks or caves
  2. 02Building influence, hazard, or wind fields
  3. 03Representing editable volumes before mesh extraction
  4. 04Testing volume containment without mesh topology

Install

Copy the command and run it in a terminal.

$npx skills add https://github.com/lvtd-llc/skills --skill game-sdf-and-field-modeling

After installing, type/game-sdf-and-field-modelingin Claude Code to confirm it loaded.

Details

From the project README

Game SDF And Field Modeling

Use this skill when a game system is better represented as a function over space than as explicit triangles. Treat fields as gameplay and content tools, not only rendering tricks.

Primary source: Geometry for Programmers by Oleksandr Kaleniuk (https://www.manning.com/books/geometry-for-programmers), transformed and paraphrased, especially chapters 2, 8, 10, and 11. Additional sources: NVIDIA GPU Gems 3 chapter 34, "Signed Distance Fields Using Single-Pass GPU Scan Conversion of Tetrahedra" (https://developer.nvidia.com/gpugems/gpugems3/part-v-physics-simulation/chapter-34-signed-distance-fields-using-single-pass-gpu), and "Designing with Distance Fields" by Perry, Frisken, and Jones (https://merl.com/publications/TR2006-054).

Core Workflow

  1. Define the field signature: point in which space goes in, what value comes out, and what sign convention means.
  2. Choose whether the function must be a true distance field or only a sign-like implicit function.
  3. Build primitive fields first, then compose with transforms, Booleans, blends, offsets, or deformation fields.
  4. Transform the input point by the inverse object transform. Do not rewrite the primitive for every translation, rotation, or scale.
  5. Track when operations preserve or destroy true distance meaning.
  6. Decide how the field becomes gameplay or renderable data: direct sampling, raymarching, mesh extraction, voxelization, particles, decals, or collision probes.
  7. Add visual debugging: slices, isolines, gradient arrows, sample points, and sign colors.

Field Types

  • Scalar field: returns a number at each point. Use for terrain height, influence, heat, fog, danger, signed distance, or density.
  • SDF: returns negative inside, zero on the boundary, positive outside, and magnitude as distance when it remains a true SDF.
  • Vector field: returns a vector at each point. Use for wind, currents, steering, force fields, deformation, and flow.
  • Deformation field: returns displacement vectors in the same space as the modeled object.
  • Implicit surrogate: returns a sign-like value but not true distance. Useful, but unsafe for operations that require distance magnitude.

SDF Operations

  • Union: take the minimum of two fields.
  • Intersection: take the maximum of two fields.
  • Subtraction: intersect the first field with the negated second field.
  • Dilation/erosion on a true SDF: add or subtract a constant according to the project's sign convention.
  • Hollowing: convert a boundary band into a shell using absolute distance and shell width.
  • Smooth blends: useful for organic shapes but may destroy exact distance semantics.

Distance Validity Rules

  • A true SDF can support reliable offsets and gradient-based movement.
  • Boolean composition usually keeps the sign behavior but not exact distance everywhere.
  • Metaballs, lemniscates, density functions, and many procedural formulas are implicit fields, not true SDFs.
  • After distance validity is lost, reinitialize or recompute distance before algorithms that depend on exact distance.
  • Gradients on noisy or sampled fields need filtering or robust finite differences.

Game Use Cases

  • Procedural rocks, caves, blobs, shields, zones, decals, and organic props.
  • Destructible or editable volumes before conversion to mesh or voxels.
  • Influence maps for AI, hazard fields, fog density, wind, water currents, and force fields.
  • Cheap inside/outside tests for volumes where mesh topology is unreliable.

Common Mistakes

  • Treating every implicit function as a true SDF.
  • Applying offsets after Booleans without checking distance validity.
  • Recomputing transforms or expensive neighbor searches per sample in a hot path.
  • Sampling a field at too low a resolution, then blaming the extraction algorithm.
  • Shipping field logic without a slice or isoline debug view.

Comments

Markdown supported