A greedy algorithm interpolates consistent signed distance functions from discrete samples by treating SDF geometric properties as hard constraints.
Graph.37, 4 (2018), 60–1
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greed for the Spheres: A Signed Distance Interpolation Method
A greedy algorithm interpolates consistent signed distance functions from discrete samples by treating SDF geometric properties as hard constraints.