Non-iterative second-order approximation of signed distance functions for any isosurface representation

  • Authors:

  • Vladimir Molchanov;Paul Rosenthal;Lars Linsen

  • Affiliations:

  • Jacobs University, Bremen, Germany;Jacobs University, Bremen, Germany;Jacobs University, Bremen, Germany

  • Venue:
  • EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they are applied to optimize collision detection, are used to reconstruct data fields or surfaces, and, in particular, are an obligatory ingredient for most level set methods. Level set methods are common in scientific visualization to extract surfaces from scalar or vector fields. Usual approaches for the construction of an SDF to a surface are either based on iterative solutions of a special partial differential equation or on marching algorithms involving a polygonization of the surface. We propose a novel method for a non-iterative approximation of an SDF and its derivatives in a vicinity of a manifold. We use a second-order algebraic fitting scheme to ensure high accuracy of the approximation. The manifold is defined (explicitly or implicitly) as an isosurface of a given volumetric scalar field. The field may be given at a set of irregular and unstructured samples. Stability and reliability of the SDF generation is achieved by a proper scaling of weights for the Moving Least Squares approximation, accurate choice of neighbors, and appropriate handling of degenerate cases. We obtain the solution in an explicit form, such that no iterative solving is necessary, which makes our approach fast.