English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Polyhedral Approach to Surface Reconstruction from Planar Contours.

MPS-Authors
/persons/resource/persons44003

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44418

Fink,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Althaus, E., & Fink, C. (2002). A Polyhedral Approach to Surface Reconstruction from Planar Contours. In Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization (pp. 258-272). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2F04-0
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.