Koschier, DanDeul, CrispinBender, JanLadislav Kavan and Chris Wojtan2016-07-102016-07-102016978-3-03868-009-31727-5288https://doi.org/10.2312/sca.20161236https://diglib.eg.org:443/handle/10.2312/sca20161236In this paper we propose a novel method to construct hierarchical hp-adaptive Signed Distance Fields (SDFs). We discretize the signed distance function of an input mesh using piecewise polynomials on an axis-aligned hexahedral grid. Besides spatial refinement based on octree subdivision to refine the cell size (h), we hierarchically increase each cell's polynomial degree (p) in order to construct a very accurate but memory-efficient representation. Presenting a novel criterion to decide whether to apply h- or p-refinement, we demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption than previous approaches. Finally, we demonstrate the usage of our representation as collision detector for geometrically highly complex solid objects in the application area of physically-based simulation.I.3.7 [Computer Graphics]Three Dimensional Graphics and RealismAnimation10.2312/sca.20161236189-198