commit | 560940fa277a469c1ab34f1aa303ff1af9c3cacf | [log] [tgz] |
---|---|---|
author | Sameer Agarwal <sameeragarwal@google.com> | Sat Jul 11 22:21:31 2015 -0700 |
committer | Sameer Agarwal <sameeragarwal@google.com> | Thu Aug 06 14:49:55 2015 -0700 |
tree | 69c0cf88eec32fc588a90f02a57fba0762be7481 | |
parent | dfdf19e111c2b0e6daeb6007728ec2f784106d49 [diff] |
A refactor of the cubic interpolation code 1. Push the boundary handling logic into the underlying array object. This has two very significant impacts: a. The interpolation code becomes extremely simple to write and to test. b. The user has more flexibility in implementing how out of bounds values are handled. We provide one default implementation. Change-Id: Ic2f6cf9257ce7110c62e492688e5a6c8be1e7df2
Please see ceres-solver.org for more information.
Ceres development happens on Gerrit, including both repository hosting and code reviews. The GitHub Repository is a continuously updated mirror which is primarily meant for issue tracking. Please see our Contributing to Ceres Guide for more details.
The upstream Gerrit repository is
https://ceres-solver.googlesource.com/ceres-solver