|
| 1 | +CHANGES |
| 2 | +======= |
| 3 | + |
| 4 | +1.0.0 |
| 5 | +----- |
| 6 | + |
| 7 | +* chore: setting up for PyPI distribution |
| 8 | +* test: fill out cpp test code with an example |
| 9 | +* docs: update timestamp |
| 10 | +* fix: euclidean\_distance\_field could be succeptible to non-boolean fields |
| 11 | +* perf: faster dijkstra3d |
| 12 | +* perf: faster euclidean distance field |
| 13 | +* perf: 10% faster |
| 14 | +* perf: bug in distance\_field3d was hurting performance a lot |
| 15 | +* fix: rows/cols swapped in path\_from\_parents |
| 16 | +* docs: updated module help |
| 17 | +* perf: added parental\_field and path\_from\_parents |
| 18 | +* docs: added anisotropy to euclidean\_distance\_field help |
| 19 | +* feat: euclidean distance field |
| 20 | +* feat: supported uints more fully for dijkstra |
| 21 | +* doc: why does fortran order work? idk |
| 22 | +* fix: simplified distance\_field |
| 23 | +* fix: reconciled various transpositions |
| 24 | +* test: added more complex test to dijkstra |
| 25 | +* fix: algorithm was not properly checking visited |
| 26 | +* fix: handle fortran order (by converting to C order..) |
| 27 | +* docs: elaborated on where different contributions to memory usage come from |
| 28 | +* docs: added benchmark |
| 29 | +* feat: added support for uints and bools |
| 30 | +* docs: added reference to Dijkstra paper |
| 31 | +* docs: how to use distance\_field, performance info |
| 32 | +* docs: added travis badge |
| 33 | +* test: added 3d tests |
| 34 | +* test: added automated tests |
| 35 | +* fix: pyx handle Fortran ordered arrays in distance\_field |
| 36 | +* fix: memory leak in distance field calculation |
| 37 | +* fix: accomodate 2d and 3d inputs to dijkstra |
| 38 | +* fix: row col depth assignment in distance\_field |
| 39 | +* fix: corrected neighbor calculation and signed bit is actually needed |
| 40 | +* feat: added prototype of distance\_field function |
| 41 | +* docs: show how to use |
| 42 | +* fix: made point cloud output sensible for 2D |
| 43 | +* refactor: broke dijkstra function into components for neatness |
| 44 | +* feat: running python code |
| 45 | +* feat: Cython bindings for dijkstra3d |
| 46 | +* feat: added dijkstra namespace, 2d and 3d functions |
| 47 | +* refactor: make x,y,z translation more explicit |
| 48 | +* perf: mostly eliminated compute\_neighborhood as a CPU suck |
| 49 | +* perf: shaved another 10sec off the 512^3 |
| 50 | +* fix: removed pairing\_heap.hpp include |
| 51 | +* perf: switched to std::priority\_queue, 20% speedup |
| 52 | +* feat: moving to 26-hood |
| 53 | +* feat: moved to 18-hood from 6-hood |
| 54 | +* refactor: allocate heap instance on stack (not the full tree) |
| 55 | +* refactor: allocate neighborhood on the stack |
| 56 | +* fix: y coordinate computed incorrectly |
| 57 | +* feat: now returns st path as a vector of array indicies |
| 58 | +* perf: break out of the loop early, saves huge computation |
| 59 | +* perf: a more dangerous, but highly performant improvement to running time |
| 60 | +* perf: faster delmin through reserving vector size |
| 61 | +* fix: dijkstra working but kinda slow, but very low memory |
| 62 | +* fix: compilation warnings |
| 63 | +* fix: improper deletion of heap |
| 64 | +* fix: segmentation fault from accessing dist after free |
| 65 | +* wip: moving towards a heap based dijkstra |
| 66 | +* chore: add -std=c++11 to test compilation |
| 67 | +* perf: why use two operations when you can have one |
| 68 | +* fix: don't segfault when printing with no root |
| 69 | +* perf: ensure compiler can optimize forest.size() |
| 70 | +* fix: propogated "last" fix for odd sizes |
| 71 | +* fix: pairing heap now sorts numbers |
| 72 | +* docs: fixed formatting in a comment |
| 73 | +* test: added heap sort test |
| 74 | +* fix: construct PHNode correctly |
| 75 | +* fix: syntax errors in pairing\_heap.hpp |
| 76 | +* feat: untested pairing heap implementation |
| 77 | +* docs: added paper references |
| 78 | +* feat: a classic algorithm, O(V^2) |
| 79 | +* Initial commit |
0 commit comments