Here are the next features we would like to implement within SLIP
Data structures:
- Generic Sequence of objects
- Graph (interface to the Boost Graph Library (BGL) )
- Generic Tree
- 2nTree (Quadtree, Octree...)
- SparseVectorFields
- Edge
Algorithms
- Classical Mathematical Morphology operators
- Classical PDE processing
- Classical Edges dectectors
- Classical Interpolations, geometrical transformations
- Classical Wavelet Transforms
- Optical flow
- Block Matching (PIV)
- Connected components labeling