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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ABACUS-A Branch And CUt System. http://www.informatik.uni-koeln.de/ls_juenger/projects/abacus.html.
Dr. Gill Barequet’s home page. http://www.cs.technion.ac.il/barequet/.
CGAL-Computational Geometry Algorithms Library. http://www.cgal.org.
Siu-Wing Cheng and Tamal K. Dey. Improved constructions of delaunay based contour surfaces. In Proceedings of the ACM Symposium on Solid Modeling and Applications, pages 322–323, 1999.
CPLEX. http://www.cplex.com.
C. Fink. Oberflächenrekonstruktion von planaren Konturen. Master’s thesis, Universität des Saarlandes, 2001.
H. Fuchs, Z. M. Kedem, and S. P. Uselton. Optimal surface reconstruction from planar contours. Graphics and Image Processing, 20(10):693–702, 1977.
M. Hong, T.W. Sederberg, K.S. Klimaszewski, and K. Kaneda. Triangulation of branching contours using area minimization. International Journal of Computational Geometry & Applications, 8(4):389–406, 1998.
V. Kann. Maximum bounded 3-dimensional matching is MAXSNP-complete. Information Processing Letters, 37:27–35, 1991.
E. Keppel. Approximating complex surfaces by triangulation of contour lines. IBM J. of Research and Development, 19:2–11, 1975.
LEDA (Library of Efficient Data Types and Algorithms). http://www.mpi-sb.mpg.de/LEDA/leda.html.
SCIL-Symbolic Constraints for Integer Linear programming. http://www.mpi-sb.mpg.de/SCIL.
Laurence A. Wolsey. Integer programming. Wiley-interscience series in discrete mathematics and optimization. Wiley & Sons, New York, 1998.
XPRESS. http://www.dash.co.uk/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Althaus, E., Fink, C. (2002). A Polyhedral Approach to Surface Reconstruction from Planar Contours. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-47867-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43676-8
Online ISBN: 978-3-540-47867-6
eBook Packages: Springer Book Archive