Rendering 3D Gaussians on a Graph Processor
We present the first implementation of a 3D Gaussian renderer on an Intelligence Processing Unit (IPU), comprising 1,472 independent tiles with only on-chip SRAM; constraints that approximate properties of efficient sensor-processor architectures. Our input scenes are 3D Gaussian maps from real-world sequences. Each tile 'owns' a screen-space region of the framebuffer; Gaussian primitives are routed to destination tiles via Manhattan-distance hops on a north-east-west-south (NEWS) grid, then distributed to overlapping neighbours in an expanding tree pattern. Computation follows the IPU's Bulk
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- FuzzySimilar title/name (fuzzy) · 59%tirth8205/code-review-graph →
“Fuzzy title match (0.73): “Rendering 3D Gaussians on a Graph Processor” ≈ “tirth8205/code-review-graph””
- LinkedLinked via arxiv author · 85%Nicholas Fry →
“Rendering 3D Gaussians on a Graph Processor”
- LinkedLinked via arxiv author · 85%Ignacio Alzugaray →
“Rendering 3D Gaussians on a Graph Processor”
- LinkedLinked via arxiv author · 85%Mark Pupilli →
“Rendering 3D Gaussians on a Graph Processor”
- LinkedLinked via arxiv author · 85%Paul H. J. Kelly →
“Rendering 3D Gaussians on a Graph Processor”
- LinkedLinked via arxiv author · 85%Andrew J. Davison →
“Rendering 3D Gaussians on a Graph Processor”