Provably correct reconstruction of surfaces from sparse noisy samples

摘要

Automated three-dimensional surface reconstruction is a very large and still fast growing area of applied computer vision and there exists a huge number of heuristic algorithms. Nevertheless, the number of algorithms which give formal guarantees about the correctness of the reconstructed surface is quite limited. Moreover such theoretical approaches are proven to be correct only for objects with smooth surfaces and extremely dense samplings with no or very few noise. We define an alternative surface reconstruction method and prove that it preserves the topological structure of multi-region objects under much weaker constraints and thus under much more realistic conditions. We derive the necessary error bounds for some digitization methods often used in discrete geometry, i.e. supercover and m-cell intersection sampling. We also give a detailed analysis of the behavior of our algorithm and compare it with other approaches.