第二个和第三个函数都重新采样您的数据集(它们基本上是在一个新的参考中表达您的图像)。
所以他们必须重新组织数据:
ny*nz
为 YZ 和nx*nz
XZ创建一个新的大小数组
- 用给定平面中的数据填充数组
- 返回指向新分配数组的指针
(在这种情况下,调用者负责释放新分配的内存。)
您的 YZ 平面算法是:
// I assume this sorting order:
// Z ^ Slices are
// / stacked along
// / the Z axis
// +-------> X
// |
// |
// Y v
// Assumes your data is stored in row major order:
// +-------> X +---------> X
// slice 0: | 0 1 2 | slice 1: | 6 7 8 | etc.
// | 3 4 5 | | 9 10 11 |
// Y v Y v
// Assumes x is the column index, y the row index, z the slice index.
// For example, you want element #9:
// - col 0 -> x = 0
// - row 1 -> y = 1
// - slice 1 -> z = 1
// I suggest you rename nx, ny, nz into nbCols, nbRows, nbSlices to make
// things explicit
index computeIndex(VolumeData *vol, int x, int y, int z)
{
int nx = vol->nx, // nb cols
ny = vol->ny, // nb rows
nz = vol->nz; // nb slices
int index = nx*ny*z // size of one slice, multiplied by slice index
+ nx*y // size of one row (nb cols), multiplied by row index
+ x; // offset in row (column index)
return index;
}
unsigned char* getYZPlaneStack(VolumeData *vol,int x)
{
int nx = vol->nx, // nb rows
ny = vol->ny, // nb columns
nz = vol->nz; // nb slices
unsigned char *newData = new unsigned char[ny*nz];
// Depth is now along the X axis
// +-----> Z
// |
// |
// Y v
for(int y = 0; y < ny; ++y) // For each row
for(int z = 0; z < nz; ++z ) // For each column
{
int i = computeIndex(vol, x, y, z);
newData[nz*y+z] = vol->data[i];
}
return newData;
}