Fast Distance Field Interpolation for Reconstruction of Surfaces from Contours
| dc.contributor.author | Klein, Reinhard | en_US |
| dc.contributor.author | Schilling, Andreas | en_US |
| dc.date.accessioned | 2015-11-11T14:04:39Z | |
| dc.date.available | 2015-11-11T14:04:39Z | |
| dc.date.issued | 1999 | en_US |
| dc.description.abstract | One simple and robust way to get a reconstruction of surfaces from a given contour stack dealing well with branching and other problems which are generally difficult to solve is based on the well known MC-algorithm. To overcome the staircase artefacts produced by the MC-algorithm Jones et. al. 3 proposed to use a distance field interpolation between the slices and to run the MC-algorithm on this distance field. The main problem of this approach is the distance field computation as it is very time consuming especially if high resolution grids (e.g. 10241024 are used. Therefore, in the original algorithm the resolution of the chosen grid is much less than the resolution of the given contour sacrificing accuracy of the resulting surface. Especially in medical applications this is not accepted by the doctors. In this paper we introduce a new method for the computation of the discrete distance field, which is a breaktrough in terms of speed and accuracy. This new method allows us to reconstruct surfaces from contour stacks with guaranteed accuracy in reasonable time. Several examples show the power of this approach. | en_US |
| dc.description.seriesinformation | Eurographics 1999 - Short Presentations | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egs.19991032 | en_US |
| dc.publisher | Eurographics Association | en_US |
| dc.title | Fast Distance Field Interpolation for Reconstruction of Surfaces from Contours | en_US |
Files
Original bundle
1 - 1 of 1