Lines Matching refs:visibility
36 #include "ceres/visibility.h"
54 vector< set<int> >* visibility) {
55 CHECK_NOTNULL(visibility);
57 // Clear the visibility vector and resize it to hold a
59 visibility->resize(0);
60 visibility->resize(block_structure.cols.size() - num_eliminate_blocks);
73 DCHECK_LT(camera_block_id, visibility->size());
74 (*visibility)[camera_block_id].insert(block_id);
79 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {
81 // Compute the number of e_blocks/point blocks. Since the visibility
83 // visible to it, we find the maximum across all visibility sets.
85 for (int i = 0; i < visibility.size(); i++) {
86 if (visibility[i].size() > 0) {
87 num_points = max(num_points, (*visibility[i].rbegin()) + 1);
91 // Invert the visibility. The input is a camera->point mapping,
97 for (int i = 0; i < visibility.size(); i++) {
98 const set<int>& visibility_set = visibility[i];
131 for (int i = 0; i < visibility.size(); ++i) {
148 visibility[camera1].size() * visibility[camera2].size())));
