Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum · 30.04.2026
DOI: 10.1111/cgf.70373 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Graphics Forum, online erschienen am 30.04.2026. Verfasst von M. Kohlbrenner und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: HORIZON EUROPE European Research Council.
Abstract (Originalsprache)
Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives better results than classical contouring algorithms. We explore the idea of generating surface points by simply approximating the gradient of the signed distance function from a tesselation of the sample locations. The distance value together with gradient yields a potential surface point. To avoid problems resulting from bad approximation, surface points are removed if they are too close to any of the distance samples. Using the regular triangulation as tesselation facilitates this filtering. The resulting approximation algorithm is conceptually simple, easy to implement, and significantly faster than existing alternatives, yielding reconstructions that are on par.
Förderung
- HORIZON EUROPE European Research Council
Zitieren
APA
Kohlbrenner, M., & Alexa, M. (2026). Contouring Signed Distance Fields by Approximating Gradients. Computer Graphics Forum. https://doi.org/10.1111/cgf.70373
Vancouver
Kohlbrenner M, Alexa M. Contouring Signed Distance Fields by Approximating Gradients. Computer Graphics Forum. 2026. doi:10.1111/cgf.70373
BibTeX
@article{Kohlbrenner2026,
author = {Kohlbrenner, M. and Alexa, M.},
title = {Contouring Signed Distance Fields by Approximating Gradients},
journal = {Computer Graphics Forum},
year = {2026},
doi = {10.1111/cgf.70373}
}
EUVIMED