Metraipolis › archive › dc_37268acc68bd

Elastic Triangle Splatting — arXiv:2608.29106

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29106
License (as archived)
CC0-1.0
Archived
2026-10-17T09:53:32.597Z
SHA-256 of the archived text
804b5b6b5d9acd7cb31b5321f1651480b6178debad2757a140266658ecb730c5
Stable URL of this page
https://metraipolis.com/documento/dc_37268acc68bd

How to cite

Elastic Triangle Splatting — arXiv:2608.29106 — arXiv (en), https://arxiv.org/abs/2608.29106 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37268acc68bd (Metraipolis archive dc_37268acc68bd, sha256 804b5b6b5d9acd7cb31b5321f1651480b6178debad2757a140266658ecb730c5)
BibTeX
@misc{dc37268acc68bd,
  title = {Elastic Triangle Splatting — arXiv:2608.29106},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29106},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37268acc68bd; sha256 804b5b6b5d9acd7cb31b5321f1651480b6178debad2757a140266658ecb730c5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29106. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

While neural rendering methods such as 3D Gaussian Splatting achieve remarkable visual fidelity, traditional polygonal meshes remain the backbone of established graphics pipelines. Triangle splatting bridges this gap by optimizing triangle primitives as differentiable splats, producing representations that are closer to mesh-based workflows. Central to these methods is the kernel function that softens triangle boundaries to propagate gradients to vertex positions. Existing triangle splatting methods make inconsistent choices of kernel functions, and analysis of these kernels' optimization behavior has been limited to unstructured triangle soups for novel-view synthesis. In this work, we consider triangle splatting as a generic tool for photometric optimization, comparing kernel properties through two complementary tasks: mesh optimization for shape reconstruction and triangle soup optimization for novel-view synthesis. Along with the analysis, we introduce an elastic kernel function that features bilateral gradient support across the boundary and an adaptive boundary value, which are shown to be essential for robust optimization. Under isolated comparison, our elastic kernel outperforms existing kernels on shape reconstruction and in the majority of novel-view synthesis benchmarks, demonstrating the importance of kernel design in the effectiveness and versatility of triangle splatting.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-01 in cs.CV).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2608.29106 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T09:28:47.978Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).