Mini-Splatting: Representing Scenes with a Constrained Number of Gaussians

Guangchi Fang, Bing Wang
2/14/2026

No official code found. Best implementation: fatPeter/mini-splatting (221 stars, last commit 2024-10-12).

Abstract

In this study, we explore the challenge of efficiently representing scenes with a constrained number of Gaussians. Our analysis shifts from traditional graphics and 2D computer vision to the perspective of point clouds, highlighting the inefficient spatial distribution of Gaussian representation as a key limitation in model performance. To address this, we introduce strategies for densification including blur split and depth reinitialization, and simplification through intersection preserving and sampling. These techniques reorganize the spatial positions of the Gaussians, resulting in significant improvements across various datasets and benchmarks in terms of rendering quality, resource consumption, and storage compression. Our Mini-Splatting integrates seamlessly with the original rasterization pipeline, providing a strong baseline for future research in Gaussian-Splatting-based works. \href{https://github.com/fatPeter/mini-splatting}{Code is available}.

View on arXivView PDF

Code Implementations(1)

22122C, C++Mar 25, 20242 years ago

Similar Papers

Cite this paper

@article{fang2026minisplatting,
  title  = {Mini-Splatting: Representing Scenes with a Constrained Number of Gaussians},
  author = {Guangchi Fang and Bing Wang},
  year   = {2026},
  eprint = {2403.14166},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2403.14166},
  journal = {ECCV 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.14166.svg)](https://codeofpaper.com/paper/2403.14166)

Discussion