arXiv (All)
open access
Implementation Note 2: Approximating a Smooth Three-Dimensional Function on a Coarse Lattice
A smooth 3D function can be efficiently and accurately approximated by a 3D lookup table of significantly lower resolution combined with tetrahedral interpolation. The function is sampled once on a coarse grid in a preprocessing step. For each input, the enclosing grid cube is located, one of the 6
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- TileGS: Tile-Local Depth Binning for Gaussian Splatting Rasterization#926517
- Marching cubes: A high resolution 3D surface construction algorithm#6514
- CADrawer: Autoregressive CAD Generation from 3D Sketches#195735
- EffGS: Efficient and High-Fidelity Gaussian Splatting#1144520
- Fast Differentiable SVD on GPU via Polar Decomposition#1116836
Record · ID 1154826
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive