Meshing Unsigned Distance Fields with Regular Triangulations
Computer Graphics Forum · 13.08.2026
DOI: 10.1111/cgf.70524 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Graphics Forum, online erschienen am 13.08.2026. Verfasst von M. Kohlbrenner und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: HORIZON EUROPE European Research Council.
Abstract (Originalsprache)
Unsigned distance fields (UDF) are a versatile, implicit representation of geometry. They can represent surfaces that are not bounding a solid or contain points or curves that are not manifold, for example several sheets meeting along a common curve. Contouring the implicit representation, i.e. turning it into an explicit one, requires finding the zero level set. This is challenging because of the lacking sign information. We present an adaptive re‐sampling approach based on regular triangulations that allows efficiently querying the UDF function at the most important locations. Using a dual contouring approach, information on the topology of the reconstructed surface patches is available during refinement, enabling to increase the resolution in the more critical non‐manifold regions.
Förderung
- HORIZON EUROPE European Research Council
Zitieren
APA
Kohlbrenner, M., & Alexa, M. (2026). Meshing Unsigned Distance Fields with Regular Triangulations. Computer Graphics Forum. https://doi.org/10.1111/cgf.70524
Vancouver
Kohlbrenner M, Alexa M. Meshing Unsigned Distance Fields with Regular Triangulations. Computer Graphics Forum. 2026. doi:10.1111/cgf.70524
BibTeX
@article{Kohlbrenner2026,
author = {Kohlbrenner, M. and Alexa, M.},
title = {Meshing Unsigned Distance Fields with Regular Triangulations},
journal = {Computer Graphics Forum},
year = {2026},
doi = {10.1111/cgf.70524}
}
EUVIMED