Various functions for manipulating image views. More...
Go to the source code of this file.
| Functions | |
| template<class T > | |
| void | vil_fill (vil_image_view< T > &view, T value) | 
| Fill view with given value. | |
| template<class T > | |
| void | vil_fill_line (T *data, unsigned n, vcl_ptrdiff_t step, T value) | 
| Fill data[i*step] (i=0..n-1) with given value. | |
| template<class T > | |
| void | vil_fill_line (vil_image_view< T > &im, int ai, int aj, int bi, int bj, T value) | 
| Fill line from (ai,aj) to (bi,bj) using Bresenham's algorithm. | |
| template<class T > | |
| void | vil_fill_row (vil_image_view< T > &view, unsigned j, T value) | 
| Fill row j in view with given value. | |
| template<class T > | |
| void | vil_fill_col (vil_image_view< T > &view, unsigned i, T value) | 
| Fill column i in view with given value. | |
| template<class srcT > | |
| void | vil_fill_mask (vil_image_view< srcT > &image, const vil_image_view< bool > &mask, srcT value, bool b=true) | 
| Writes given value into each pixel of image under the elements of the mask set to b. | |
| template<class T > | |
| void | vil_fill_disk (vil_image_view< T > &image, double ci, double cj, double r, T value) | 
| Fills pixels in disk with centre (ci,cj), radius r, with given value. | |
Various functions for manipulating image views.
Definition in file vil_fill.h.
| void vil_fill | ( | vil_image_view< T > & | view, | 
| T | value | ||
| ) | 
| void vil_fill_col | ( | vil_image_view< T > & | view, | 
| unsigned | i, | ||
| T | value | ||
| ) | 
| void vil_fill_disk | ( | vil_image_view< T > & | image, | 
| double | ci, | ||
| double | cj, | ||
| double | r, | ||
| T | value | ||
| ) |  [inline] | 
Fills pixels in disk with centre (ci,cj), radius r, with given value.
Fills all planes of image with the value.
Definition at line 198 of file vil_fill.h.
| void vil_fill_line | ( | T * | data, | 
| unsigned | n, | ||
| vcl_ptrdiff_t | step, | ||
| T | value | ||
| ) | 
Fill data[i*step] (i=0..n-1) with given value.
Definition at line 44 of file vil_fill.h.
| void vil_fill_line | ( | vil_image_view< T > & | im, | 
| int | ai, | ||
| int | aj, | ||
| int | bi, | ||
| int | bj, | ||
| T | value | ||
| ) | 
Fill line from (ai,aj) to (bi,bj) using Bresenham's algorithm.
Only modifies first plane.
Definition at line 55 of file vil_fill.h.
| void vil_fill_mask | ( | vil_image_view< srcT > & | image, | 
| const vil_image_view< bool > & | mask, | ||
| srcT | value, | ||
| bool | b = true | ||
| ) |  [inline] | 
Writes given value into each pixel of image under the elements of the mask set to b.
If mask.nplanes()==1 then the same mask is applied to every image plane, otherwise there must be the same number of mask planes as image planes.
Definition at line 162 of file vil_fill.h.
| void vil_fill_row | ( | vil_image_view< T > & | view, | 
| unsigned | j, | ||
| T | value | ||
| ) | 
 1.7.5.1
 1.7.5.1