Computing Local Signed Distance Fields for Large Polygonal Models

dc.contributor.authorChang, Byungjoonen_US
dc.contributor.authorCha, Deukhyunen_US
dc.contributor.authorIhm, Insungen_US
dc.contributor.editorA. Vilanova, A. Telea, G. Scheuermann, and T. Moelleren_US
dc.date.accessioned2014-02-21T18:45:02Z
dc.date.available2014-02-21T18:45:02Z
dc.date.issued2008en_US
dc.description.abstractThe 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume27en_US
dc.identifier.doi10.1111/j.1467-8659.2008.01210.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2008.01210.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleComputing Local Signed Distance Fields for Large Polygonal Modelsen_US
Files