Computing Local Signed Distance Fields for Large Polygonal Models
Loading...
Date
2008
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing Ltd.
Abstract
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is more effective to build a local distance field only within a narrow band around the surface that holds local geometric information for the model. In this paper, we present a novel technique to construct a volumetric local signed distance field of a polygonal model. To compute the local field efficiently, exactly those cells that cross the polygonal surface are found first through a new voxelization method, building a list of intersecting triangles for each boundary cell. After their neighboring cells are classified, the triangle lists are exploited to compute the local signed distance field with minimized voxel-totriangle distance computations. While several efficient methods for computing the distance field, particularly those harnessing the graphics processing unit's (GPU's) processing power, have recently been proposed, we focus on a CPU-based technique, intended to deal flexibly with large polygonal models and high-resolution grids that are often too bulky for GPU computation.
Description
@article{:10.1111/j.1467-8659.2008.01210.x,
journal = {Computer Graphics Forum},
title = {{Computing Local Signed Distance Fields for Large Polygonal Models}},
author = {Chang, Byungjoon and Cha, Deukhyun and Ihm, Insung},
year = {2008},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {/10.1111/j.1467-8659.2008.01210.x}
}