UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

An hp-adaptive discretization algorithm for signed distance field generation

Koschier, D; Deul, C; Brand, M; Bender, J; (2017) An hp-adaptive discretization algorithm for signed distance field generation. IEEE Transactions on Visualization and Computer Graphics , 23 (10) pp. 2208-2221. 10.1109/TVCG.2017.2730202. Green open access

[img]
Preview
Text
Koschier_An hp-Adaptive Discretization Algorithm for Signed Distance Field Generation_AAM.pdf - ["content_typename_Accepted version" not defined]

Download (4MB) | Preview

Abstract

In this paper we present an hp-adaptive algorithm to generate discrete higher-order polynomial Signed Distance Fields (SDFs) on axis-aligned hexahedral grids from manifold polygonal input meshes. Using an orthonormal polynomial basis, we efficiently fit the polynomials to the underlying signed distance function on each cell. The proposed error-driven construction algorithm is globally adaptive and iteratively refines the SDFs using either spatial subdivision (h-refinement) following an octree scheme or by cell-wise adaption of the polynomial approximation's degree (p-refinement). We further introduce a novel decision criterion based on an error-estimator in order to decide whether to apply por h-refinement. We demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption compared to previous approaches. While the cell-wise polynomial approximation will result in highly accurate SDFs, it can not be guaranteed that the piecewise approximation is continuous over cell interfaces. Therefore, we propose an optimization-based post-processing step in order to weakly enforce continuity. Finally, we apply our generated SDFs as collision detector to the physically-based simulation of geometrically highly complex solid objects in order to demonstrate the practical relevance and applicability of our method.

Type: Article
Title: An hp-adaptive discretization algorithm for signed distance field generation
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/TVCG.2017.2730202
Publisher version: https://doi.org/10.1109/TVCG.2017.2730202
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Memory management, Computational modeling, Adaptation models, Collision avoidance, Animation, Octrees
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/10056695
Downloads since deposit
51Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item