Deformable Triangle Splatting: Flexible Primitives for Real-Time Radiance Field Rendering

• URL: http://arxiv.org/abs/2607.22446v1
• Date: Fri, 24 Jul 2026 16:08:26 GMT
• Title: Deformable Triangle Splatting: Flexible Primitives for Real-Time Radiance Field Rendering
• Abstract summary: Recent radiance field methods represent 2D primitives that offer surface alignment and efficientization.<n>We introduce Deformable Splatting Triangle, which augments each scene with versatility.
• Score: 18.633528239379483
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent radiance field methods represent scenes with 2D primitives that offer surface alignment and efficient rasterization, from Gaussian disks to triangles, yet all rely on convex boundaries: curved and concave structures demand excessive primitives. We introduce Deformable Triangle Splatting, which augments each triangle with $K$ control points per edge, each parameterized by a single learnable scalar displacement that shifts the boundary inward or outward, enabling non-convex shape representation while preserving the three base vertices that define the 3D plane. To render these non-convex primitives differentiably, we design a rasterization pipeline in the triangle's barycentric coordinate space, ensuring view-consistent rendering. A winding number test determines whether each pixel lies inside the deformed primitive, and a window function controlled by two learnable parameters, sharpness and corner smoothness, together with a per-primitive scalar opacity, produces the smooth opacity transition from interior to boundary. Validation is done in a variety of real-world scenes, outperforming recent works based on non-volumetric primitives in terms of visual quality and versatility while still achieving competitive rendering efficiency.

Related papers

• Arbitrary Polygon Oscillator: Generalizing Polygonal Synthesis to Arbitrary Shapes, Morphing, and Three-Dimensional Polyhedra [0.0]
  Existing formulations operate on regular, parametrically defined polygons.<n>This paper generalizes polygonal synthesis around a unified arc-length engine.<n>The system runs in RNBO (Cycling'74) with a geometry caching strategy that avoids per-sample recomputation.
  arXiv  Detail & Related papers  (2026-08-25T15:38:41Z)
• CylinderSplat: 3D Gaussian Splatting with Cylindrical Triplanes for Panoramic Novel View Synthesis [53.231427733457224]
  CylinderSplat is a feed-forward framework for panoramic 3DGS.<n>It achieves state-of-the-art results in both single-view and multi-view panoramic novel view synthesis.
  arXiv  Detail & Related papers  (2026-03-06T04:04:20Z)
• UTrice: Unifying Primitives in Differentiable Ray Tracing and Rasterization via Triangles for Particle-Based 3D Scenes [1.633289883726582]
  Ray tracing 3D Gaussian particles enables realistic effects such as depth of field refractions, and flexible camera modeling for novel-view rendering.<n>Existing methods trace Gaussians through triangle geometry, which requires constructing complex intermediate meshes and performing costly tests.<n>We propose a differentiable triangle-based ray tracing pipeline that treats triangles as rendering primitives without relying on any proxy geometry.
  arXiv  Detail & Related papers  (2025-12-04T03:33:10Z)
• Radiance Meshes for Volumetric Reconstruction [56.51690637804858]
  We introduce radiance meshes, a technique for representing radiance fields with constant density tetrahedral cells.<n>Our model is able to perform exact and fast volume rendering using both synthesisization and ray-tracing.<n>Our rendering method exactly evaluates the volume equation and enables high quality, real-time view on standard consumer hardware.
  arXiv  Detail & Related papers  (2025-12-03T18:57:03Z)
• You Need a Transition Plane: Bridging Continuous Panoramic 3D Reconstruction with Perspective Gaussian Splatting [57.44295803750027]
  We present a novel framework, named TPGS, to bridge continuous panoramic 3D scene reconstruction with perspective Gaussian splatting.<n>Specifically, we optimize 3D Gaussians within individual cube faces and then fine-tune them in the stitched panoramic space.<n>Experiments on indoor and outdoor, egocentric, and roaming benchmark datasets demonstrate that our approach outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-04-12T03:42:50Z)
• BG-Triangle: Bézier Gaussian Triangle for 3D Vectorization and Rendering [60.240908644910874]
  Differentiable rendering enables efficient optimization by allowing gradients to be computed through the rendering process.<n>Existing solutions approximate or re-formulate traditional rendering operations using smooth, probabilistic proxies.<n>We present a novel hybrid representation that combines B'ezier triangle-based vector graphics primitives with Gaussian-based probabilistic models.
  arXiv  Detail & Related papers  (2025-03-18T06:53:52Z)
• LinPrim: Linear Primitives for Differentiable Volumetric Rendering [51.56484100374058]
  We introduce two new scene representations based on linear primitives.<n>We present a different octaiableizer that runs efficiently on GPU.<n>We demonstrate comparable performance to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-01-27T18:49:38Z)
• Binary Opacity Grids: Capturing Fine Geometric Detail for Mesh-Based View Synthesis [70.40950409274312]
  We modify density fields to encourage them to converge towards surfaces, without compromising their ability to reconstruct thin structures. We also develop a fusion-based meshing strategy followed by mesh simplification and appearance model fitting. The compact meshes produced by our model can be rendered in real-time on mobile devices.
  arXiv  Detail & Related papers  (2024-02-19T18:59:41Z)
• Differentiable Surface Triangulation [40.13834693745158]
  We present a differentiable surface triangulation that enables optimization for any per-vertex or per-face differentiable objective function over the space of underlying surface triangulations. Our method builds on the result that any 2D triangulation can be achieved by a suitably weighted Delaunay triangulation. We extend the algorithm to 3D by decomposing shapes into developable sets and differentiably meshing each set with suitable boundary constraints.
  arXiv  Detail & Related papers  (2021-09-22T12:42:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.