Subgrid marching tetrahedra generalizes normal coordinates to encode arbitrary surface intersections per grid edge, enabling manifold mesh recovery without Nyquist limits.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GR 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
SDFRaster optimizes a continuous SDF on a Delaunay tetrahedral grid, renders it by rasterizing tetrahedra, and integrates differentiable Marching Tetrahedra for end-to-end mesh reconstruction without post-processing.
citing papers explorer
-
Subgrid Marching Tetrahedra
Subgrid marching tetrahedra generalizes normal coordinates to encode arbitrary surface intersections per grid edge, enabling manifold mesh recovery without Nyquist limits.
-
Distance Field Rasterization for End-to-End Mesh Reconstruction
SDFRaster optimizes a continuous SDF on a Delaunay tetrahedral grid, renders it by rasterizing tetrahedra, and integrates differentiable Marching Tetrahedra for end-to-end mesh reconstruction without post-processing.