Computing Local Signed Distance Fields for Large Polygonal Models
| dc.contributor.author | Chang, Byungjoon | en_US |
| dc.contributor.author | Cha, Deukhyun | en_US |
| dc.contributor.author | Ihm, Insung | en_US |
| dc.contributor.editor | A. Vilanova, A. Telea, G. Scheuermann, and T. Moeller | en_US |
| dc.date.accessioned | 2014-02-21T18:45:02Z | |
| dc.date.available | 2014-02-21T18:45:02Z | |
| dc.date.issued | 2008 | en_US |
| dc.description.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. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 27 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2008.01210.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Computing Local Signed Distance Fields for Large Polygonal Models | en_US |