rotate-me-fast/TODO.md

[-] Draw rotated pixels in src order -> cache write miss
[X] Use atan2 at beginning and end of line.
    Interpolation in-between values
[X] Test pixel perfect 90
[ ] Fix out-of-bounds pixel set

[ ] Optimization for square images?
[X] Fixed point computation
[-] -funroll-loops -> no gain
[-] restrict qualifier -> unavailable in C++

# Cache
[-] Rotate per channel -> no gain
[X] Cut image in tiles
 [X] Overlap
 [-] Rotate in one temp tile then copy/move it
 [X] Align tiles in memory

## Alignement
[X] RGBX format (create pixel structure) on 8 bytes (can do computation in-place)
[ ] Load pixels in 64-bit variable
[ ] Align memory on 16 bytes

## Layout
[ ] Pack 4 neighbors in 16B structure (aligned)
    Each point is followed by the point below
[ ] Spiral layout?

# Quality
[X] Interpolate using SIMD, SSE (no big gain, alignement problem?)
[ ] Image borders
Implement pixels as RGBX structure. - Add ‘make debug’ target - Add links in README 2014-07-12 22:37:15 +02:00			`[-] Draw rotated pixels in src order -> cache write miss`
Add check_90(). - Fix border. 2014-06-26 21:28:34 +02:00			`[X] Use atan2 at beginning and end of line.`
			`Interpolation in-between values`
			`[X] Test pixel perfect 90`
FIll new interpolated pixels. - Take input image in argument. - Allow set_pixel() out of bounds, noop. 2014-06-26 23:45:02 +02:00			`[ ] Fix out-of-bounds pixel set`

Add check_90(). - Fix border. 2014-06-26 21:28:34 +02:00			`[ ] Optimization for square images?`
Implement pixels as RGBX structure. - Add ‘make debug’ target - Add links in README 2014-07-12 22:37:15 +02:00			`[X] Fixed point computation`
			`[-] -funroll-loops -> no gain`
			`[-] restrict qualifier -> unavailable in C++`
Use a unique buffer for pixels (scanline). - Add rotate_pixel(). - Remove APoint, use Point instead. 2014-06-28 13:52:24 +02:00
			`# Cache`
Update TODO. 2014-07-04 00:23:21 +02:00			`[-] Rotate per channel -> no gain`
			`[X] Cut image in tiles`
Create small overlap in tiles. Tiles overlap on the bottom line and the right column. Having an overlap allows us to get neighbor points for each point in a tile, regardless of its position. 2014-07-10 19:40:51 +02:00			`[X] Overlap`
Remove temp tile. 2014-07-08 08:48:17 +02:00			`[-] Rotate in one temp tile then copy/move it`
Allocate tiles as a unified buffer. 2014-07-09 07:50:09 +02:00			`[X] Align tiles in memory`
Implement pixels as RGBX structure. - Add ‘make debug’ target - Add links in README 2014-07-12 22:37:15 +02:00
			`## Alignement`
			`[X] RGBX format (create pixel structure) on 8 bytes (can do computation in-place)`
			`[ ] Load pixels in 64-bit variable`
			`[ ] Align memory on 16 bytes`

			`## Layout`
			`[ ] Pack 4 neighbors in 16B structure (aligned)`
			`Each point is followed by the point below`
Create small overlap in tiles. Tiles overlap on the bottom line and the right column. Having an overlap allows us to get neighbor points for each point in a tile, regardless of its position. 2014-07-10 19:40:51 +02:00			`[ ] Spiral layout?`
Use a unique buffer for pixels (scanline). - Add rotate_pixel(). - Remove APoint, use Point instead. 2014-06-28 13:52:24 +02:00
			`# Quality`
Implement pixels as RGBX structure. - Add ‘make debug’ target - Add links in README 2014-07-12 22:37:15 +02:00			`[X] Interpolate using SIMD, SSE (no big gain, alignement problem?)`
Update TODO. 2014-07-04 00:23:21 +02:00			`[ ] Image borders`