3D Surface Models by Geometric Constraints Propagation
Abstract
This paper proposes a technique for estimating piece wise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization of 2D points, the position of the 3D point is estimated as a polyhedron containing all the possible solutions of the triangulation. Then, given the topological structure of the 3D points cloud, geometric relationships among facets, such as coplanarity, parallelism, orthogonality, and angle equality, are automatically detected. A subset of them that is sufficient to stabilize the 3D model estimation is selected with a flow-network based algorithm. Finally a feasible instance of the 3D model, i.e. one that satisfies the selected geometric relationships and whose 3D points lie within the associated polyhedral bounds, is computed by solving a Constraint Satisfaction Problem.
Cite
Text
Farenzena and Fusiello. "3D Surface Models by Geometric Constraints Propagation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008. doi:10.1109/CVPR.2008.4587776Markdown
[Farenzena and Fusiello. "3D Surface Models by Geometric Constraints Propagation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008.](https://mlanthology.org/cvpr/2008/farenzena2008cvpr-d/) doi:10.1109/CVPR.2008.4587776BibTeX
@inproceedings{farenzena2008cvpr-d,
title = {{3D Surface Models by Geometric Constraints Propagation}},
author = {Farenzena, Michela and Fusiello, Andrea},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2008},
doi = {10.1109/CVPR.2008.4587776},
url = {https://mlanthology.org/cvpr/2008/farenzena2008cvpr-d/}
}