Robust Generation of Signed Distance Fields from Triangle Meshes
| dc.contributor.author | Bærentzen, J. Andreas | en_US |
| dc.contributor.editor | Klaus Mueller and Thomas Ertl and Eduard Groeller | en_US |
| dc.date.accessioned | 2014-01-29T17:43:13Z | |
| dc.date.available | 2014-01-29T17:43:13Z | |
| dc.date.issued | 2005 | en_US |
| dc.description.abstract | A new method for robust generation of distance fields from triangle meshes is presented. Graphics hardware is used to accelerate a technique for generating layered depth images. From multiple layered depth images, a binary volume and a point representation are extracted. The point information is then used to convert the binary volume into a distance field. The method is robust and handles holes, spurious triangles and ambiguities. Moreover, the method lends itself to boolean operations between solids. Since a point cloud as well as a signed distance is generated, it is possible to extract an iso-surface of the distance field and fit it to the point set. Using this method, one may recover sharp edge information. Examples are given where the method for generating distance fields coupled with mesh fitting is used to perform boolean and morphological operations on triangle meshes. [volume graphics] [layered depth image] [distance field] | en_US |
| dc.description.seriesinformation | Volume Graphics 2005 | en_US |
| dc.identifier.isbn | 3-905673-26-6 | en_US |
| dc.identifier.issn | 1727-8376 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VG/VG05/167-175 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling | en_US |
| dc.title | Robust Generation of Signed Distance Fields from Triangle Meshes | en_US |
Files
Original bundle
1 - 1 of 1