View Related Documents

Abstract

We investigate the problem of reconstruction a surface given its contours on parallel slices. We present a branch-and-cut algorithm which computes the surface with the minimal area. This surface is assumed to be the best reconstruction since a long time. Nevertheless there were no algorithms to compute this surface. Our experiments show that the running time of our algorithm is very reasonable and that the computed surfaces are highly similar to the original surfaces.
Research partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).

Fulltext Preview

Image of the first page of the fulltext document