54                        vector< set<int> >* visibility) {  in ComputeVisibility()
55   CHECK_NOTNULL(visibility);  in ComputeVisibility()
59   visibility->resize(0);  in ComputeVisibility()
60   visibility->resize(block_structure.cols.size() - num_eliminate_blocks);  in ComputeVisibility()
73       DCHECK_LT(camera_block_id, visibility->size());  in ComputeVisibility()
74       (*visibility)[camera_block_id].insert(block_id);  in ComputeVisibility()
79 Graph<int>* CreateSchurComplementGraph(const vector<set<int> >& visibility) {  in CreateSchurComplementGraph()  argument
85   for (int i = 0; i < visibility.size(); i++) {  in CreateSchurComplementGraph()
86     if (visibility[i].size() > 0) {  in CreateSchurComplementGraph()
87       num_points = max(num_points, (*visibility[i].rbegin()) + 1);  in CreateSchurComplementGraph()
97   for (int i = 0; i < visibility.size(); i++) {  in CreateSchurComplementGraph()
98     const set<int>& visibility_set = visibility[i];  in CreateSchurComplementGraph()
131   for (int i = 0; i < visibility.size(); ++i) {  in CreateSchurComplementGraph()
148                   visibility[camera1].size() * visibility[camera2].size())));  in CreateSchurComplementGraph()