dc.contributor.author | Satherley, Richard | en_US |
dc.contributor.author | Jones, Mark W. | en_US |
dc.contributor.editor | K. Mueller and A. Kaufman | en_US |
dc.date.accessioned | 2014-01-29T17:20:52Z | |
dc.date.available | 2014-01-29T17:20:52Z | |
dc.date.issued | 2001 | en_US |
dc.identifier.isbn | 3-211-83737-X | en_US |
dc.identifier.issn | 1727-8376 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/VG/VG01/195-209 | en_US |
dc.description.abstract | Distance fields are a widely investigated area within the area of Volume Graphics. Research is divided between applications; such as skeletonisation, hypertexture, voxelisation, acceleration of rendering techniques, correlation and collision detection; and the fundamental algorithmic calculation of the distance fields. This paper concentrates on the latter by presenting a new method for calculating distance fields and comparing it with the current best approximate method and the true Euclidean distance field. Details are given of the algorithm, and the acceleration methods that are used for calculating the true distance field. Brief descriptions of applications for these accurate distance fields are given at the end of the paper. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Hybrid Distance Field Computation | en_US |
dc.description.seriesinformation | Volume Graphics | en_US |