Change the function to test the Monge and inverse Monge characterization in order to avoid overflows
Add print matrix method for debug.
Add some new ways to create random Monge matrices. These functions are to be evaluated to ensure they are interesting for the tests.
Change generation method names.
Add a new way to generate Monge matrices. This one is a good one (at least for one of the envelope tree).
Add a benchmark criteria for envelope trees.
Bugfix: the print method did not print the last line and the last column of the matrix.
Bugfix: forgot to take the value instead of the pointer.
Bugfix: the query on the RMQ data structure has to be done on indices, not column position.
Fix bugs in the RMQ data structure implementation
Bugfix: take the right range when querying the RMQ.
The prefix search was incorrectly indexed. Just fix that.
Bugfix: we had a segmentation fault when deallocating copied RMQ nodes.
Add some helper methods in order to implement a slightly different way to compute the max over an envelope tree.
Implement a first version of a different way to compute the maximum in the envelope tree without directly getting the canonical nodes.
Update benchmarking tools.
Change the binary search in the envelope so that we can specify a minimum and maximum index for the search.
Change the borderline cases assignment for the crossing breakpoint index to avoid assigning -1 to an unsigned long long
Keep a copy of the previous version in order to do some benchmarks.
Implement a cascading version of the algorithm which restricts the successive searches in the envelope (this is supposed to be faster but it does not seem to be the case).