AI & ML
AbacusGS: Gaussian Splatting without Per-Splat Sorting
arXiv cs.GR0 views
arXiv:2611.01534v2 Announce Type: replace-cross Abstract: 3D Gaussian Splatting sorts every splat by depth in every frame. Viewers that draw splats with the hardware rasterizer and sort them on the CPU, as most web and mobile viewers do, spend most of the frame time in this sort. We present AbacusGS, which stores the blending order of a 3DGS scene in the scene layout. AbacusGS groups the splats into octree boxes of at most 128 splats and stores each box in order along an axis chosen at write time. In each frame, AbacusGS sorts only the visible boxes, and one dot product per box decides whether the box is read forward or backward. A short order-aware fine-tuning converts an existing 3DGS model, and the over operator of 3DGS stays unchanged. On 13 standard scenes, AbacusGS loses 0.13 dB PSNR on average against an equally fine-tuned 3DGS model. In an OpenGL viewer that orders splats on the CPU, AbacusGS renders frames 4.5 times faster than per-splat sorting. We also present a compact format of 17 bytes per splat and a CUDA tile renderer that use the same order. The code will be released.
Source:https://arxiv.org/abs/2611.01534PreviousLearning Generalizable Hand-Object Tracking from Synthetic DemonstrationsNextVirtual EMI Receiver Generation (VERGE) for Improved EMI Removal in MRI
Related posts

Google Home speakers get a major Gemini upgrade ‘soon,’ but only for paid subscribers
09to5Google

NVIDIA's CEO Shake-Up Exposes a Costly Prediction Market Deadline
0HackerNoon
Lumi-4B AI Model: Everything You Need to Know
0HackerNoon
The End of the Mouse: How AI Could Change the Way We Use Computers
0HackerNoon
How to Structure AI Adoption Teams and Measure Software Delivery Improvements
0HackerNoon
A Seven-Slide Framework for Funding AI Transformation Without New Headcount
0HackerNoon