Features

SLIP is build using generic programming paradigm. Consequently programs are decomposed in 3 entities:

1. generic data structures that we will call the containers in the following

iterators to iterate the containers

1. generic algorithm to process containers

The main advantage of the generic programming is that we only have to write a generic algorithm once. The iterators will make the interface between the algorithms and the containers in order to treat either the whole containers eitherx just a piece of them. When we have not find containers, iterators or algorithms well adapted for image processing in the standard c++ or in Boost C++ libraries, we have developped them. Besides as most of the image processing algorithms need to handle neighbors, we have defined some usefull and classical neighborhoods. All the SLIP feateures are presented in details in the following.

• Containers (data structures)
• Iterators
• Algorithms
• Neighbors
• Input/output external algorithms