Title
Revisiting Adaptively Sampled Distance Fields
Abstract
Implicit surfaces are a powerful shape description for many applications in computer graphics. An implicit surface is defined by a function f:R3→R as the set of points satisfying f(p)=0. Implicit representation becomes more effective when f is a signed distance function, i.e., when |f| gives the distance to the closest point on the surface and f is negative inside the object and positive outside the object bounded by the surface. The distance function to an arbitrary surface does not have a simple analytic description, and we must resort to approximations. One simple solution is to use a volumetric representation, constructed by sampling f uniformly, but such models are very large and their resolution is limited by the sampling rate. Frisken et al. (2000) proposed adaptively sampled distance fields (ADFs) as a way to overcome these problems. The authors revisit the ADFs and make two contributions to the original framework. First, we analyse the ADF representation and discuss some possible improvements. Second, we show how to compute ADFs more efficiently
Year
DOI
Venue
2001
10.1109/SIBGRAPI.2001.963083
Florianopolis
Keywords
Field
DocType
revisiting adaptively sampled distance,signed distance function,adaptive systems,shape,skeleton,distance field,satisfiability,ray tracing,computer graphic,computer graphics,solids,application software,testing,sampling,sampling methods,distance function,interpolation
Discrete mathematics,Signed distance function,Adaptive system,Sampling (signal processing),Metric (mathematics),Closest point,Sampling (statistics),Computer graphics,Mathematics,Bounded function
Conference
ISBN
Citations 
PageRank 
0-7695-1330-1
3
0.42
References 
Authors
1
3
Name
Order
Citations
PageRank
Luiz Henrique de Figueiredo162962.99
Luiz Velho21162120.74
João Batista de Oliveira330.42