Gaussian splatting

Version 1 of 5

Point splats.

CPU · QSplat-style · 2000

This version

The scene's 23,000 points drawn as opaque squares sized by distance, back to front. You can see the object, and every point.

How this version works

At 200 pixels wide, this version projects the garden points through an orbiting camera and draws them in depth order over a 64-colour sky gradient. Each point becomes an opaque square whose size comes from the largest diagonal entry of its covariance, scaled by inverse distance. Points with opacity below 0.3 or camera depth below 0.2 are skipped. Unlike the elliptical versions, it ignores orientation and soft edges, filling each square with the point's stored colour.

The trick in this version

Typed-array row fills make the square footprints cheap to draw on the CPU. Depth ordering supplies visibility without a per-pixel depth buffer; this is a QSplat-style simplification, not an implementation of its hierarchical renderer.

Historical context · Research

  1. 2000 · Szymon Rusinkiewicz & Marc Levoy

    QSplat

    Huge scanned models rendered interactively as hierarchies of point splats, points instead of triangles.

  2. 2001 · Zwicker, Pfister, van Baar & Gross · SIGGRAPH 2001

    Surface splatting (EWA)

    Each point becomes an elliptical Gaussian filtered in screen space, the projection maths that 3D Gaussian splatting still uses.

  3. 1990 · Lee Westover · SIGGRAPH 1990

    Splatting

    ‘Footprint evaluation for volume rendering’: instead of casting rays, each data sample is projected and its footprint spread onto the image, the word and the idea of splatting.

Platform
CPU · QSplat-style
Era
Research
Rendered on
CPU
Tags
points · painter's algorithm
Sources
QSplat (2000)Surface splatting (EWA) (2001)Splatting (1990)