A Polyhedral Approach to Surface Reconstruction from Planar Contours

Authors:
Ernst Althaus;Christian Fink
Affiliations:
-;-
Venue:
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2002

Citing 4
Cited 0

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Improved constructions of Delaunay based contour surfaces

Proceedings of the fifth ACM symposium on Solid modeling and applications
Optimal surface reconstruction from planar contours

Communications of the ACM
Approximating complex surfaces by triangulation of contour lines

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

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.