| // Ceres Solver - A fast non-linear least squares minimizer |
| // Copyright 2013 Google Inc. All rights reserved. |
| // http://code.google.com/p/ceres-solver/ |
| // |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are met: |
| // |
| // * Redistributions of source code must retain the above copyright notice, |
| // this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above copyright notice, |
| // this list of conditions and the following disclaimer in the documentation |
| // and/or other materials provided with the distribution. |
| // * Neither the name of Google Inc. nor the names of its contributors may be |
| // used to endorse or promote products derived from this software without |
| // specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| // POSSIBILITY OF SUCH DAMAGE. |
| // |
| // Author: sameeragarwal@google.com (Sameer Agarwal) |
| |
| #ifndef CERES_INTERNAL_COMPRESSED_COL_SPARSE_MATRIX_UTILS_H_ |
| #define CERES_INTERNAL_COMPRESSED_COL_SPARSE_MATRIX_UTILS_H_ |
| |
| #include <vector> |
| #include "ceres/internal/port.h" |
| |
| namespace ceres { |
| namespace internal { |
| |
| // Extract the block sparsity pattern of the scalar compressed columns |
| // matrix and return it in compressed column form. The compressed |
| // column form is stored in two vectors block_rows, and block_cols, |
| // which correspond to the row and column arrays in a compressed |
| // column sparse matrix. |
| // |
| // If c_ij is the block in the matrix A corresponding to row block i |
| // and column block j, then it is expected that A contains at least |
| // one non-zero entry corresponding to the top left entry of c_ij, |
| // as that entry is used to detect the presence of a non-zero c_ij. |
| void CompressedColumnScalarMatrixToBlockMatrix(const int* scalar_rows, |
| const int* scalar_cols, |
| const vector<int>& row_blocks, |
| const vector<int>& col_blocks, |
| vector<int>* block_rows, |
| vector<int>* block_cols); |
| |
| // Given a set of blocks and a permutation of these blocks, compute |
| // the corresponding "scalar" ordering, where the scalar ordering of |
| // size sum(blocks). |
| void BlockOrderingToScalarOrdering(const vector<int>& blocks, |
| const vector<int>& block_ordering, |
| vector<int>* scalar_ordering); |
| |
| } // namespace internal |
| } // namespace ceres |
| |
| #endif // CERES_INTERNAL_COMPRESSED_COL_SPARSE_MATRIX_UTILS_H_ |
