[vtkusers] getting neighbor points

[Lothar Mausz]

Hello,


I am implementing an algorithm (chainmail and relaxation) for deformation of
volume based data in vtk.

The algorithm changes point coordinates in a structur, the number of
points - the whole topology stays the same.
In addition, it works with conditions between neighbor points. Neigbor
points are the 6 nearest points refering to topology.
Front, back, right, left, top and bottom neighbors of points in a 3D Matrix
with regular topology, like vtkImageData.

So there are 3 major conditions for the data structur I need:

1: single points can be moved in the structur, without changing the
topology. (vtkStructuredGrid, vtkUnstructuredGrid, vtkPolydata)
2: I have to know the 6 neighbors of every point.
3: everything should be very fast. *g*


What I want to know:

-> Is there a similar filter or algorithm in vtk?
-> Which data structur should I use?
-> How can I access the 6 neighbor points?

Currently, I use a vtkUnstructuredGrid and try to get  neighbor points via 8
VTK_VOXEL cells. Is there a better way to do this?


Thanks for your help,


Lothar.