Hierarchical hp-Adaptive Signed Distance Fields

Koschier, Dan; Deul, Crispin; Bender, Jan

Hierarchical hp-Adaptive Signed Distance Fields

Files

189-198.pdf (8.72 MB)

video.mp4 (183.28 MB)

Date

2016

Authors

Koschier, Dan
Deul, Crispin
Bender, Jan

Publisher

The Eurographics Association

Abstract

In 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.

        @inproceedings{10.2312:sca.20161236
,
booktitle = {Eurographics/ ACM SIGGRAPH Symposium on Computer Animation
},
editor = {Ladislav Kavan and Chris Wojtan
},
title = {{Hierarchical hp-Adaptive Signed Distance Fields
}},
author = {Koschier, Dan and 
Deul, Crispin and 
Bender, Jan
},
year = {2016
},
publisher = {The Eurographics Association
},
ISSN = {1727-5288
},
ISBN = {978-3-03868-009-3
},
DOI = {10.2312/sca.20161236
}
}