Fast distance field interpolation for reconstruction of surfaces from contoursure

DSpace Repository


URI: http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-11951
Dokumentart: Report (Bericht)
Date: 1999
Source: WSI ; 1999 ; 15
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Sonstige - Informations- und Kognitionswissenschaften
DDC Classifikation: 004 - Data processing and computer science
Keywords: Tübingen / Wilhelm-Schickard-Institut für Informatik
License: xmlui.dri2xhtml.METS-1.0.item-dc-rights_value_ubt-nopod
Show full item record


Veröffentlichung des Wilhelm-Schickard-Institut für Informatik Universität Tübingen


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. 1024 x 1024 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.

This item appears in the following Collection(s)