Re: distance between adjacent particles

Posted by karo03 on May 10, 2007; 7:08am
URL: http://imagej.273.s1.nabble.com/distance-between-adjacent-particles-tp3699485p3699495.html

Hi, Gabriel
Just for clarification: The set of closest neighbored points is  
something more than NNG (nearest-neighbour graph). It has something  
to do with our visual behavior, how we relate neighbored objects. One  
result of DT (Delaunay triangulation) could be the list of neighbors  
per point. From which easily an 'arrangement parameter' (mean of  
distances) could be deduced. This again is of course highly related  
to the mean area of Voronoi polygones of one point or the watershed  
bassins neighbored to a region.

Regards
Karsten

Am 09.05.2007 um 23:57 schrieb Gabriel Landini:

> On Wednesday 09 May 2007 22:16:41 Karsten Rodenacker wrote:
>> Typically the neighbors of points under a Delaunay triangulation are
>> what can be considered as the 'closest neighbors'.
>
> You are right, the nearest-neighbour graph is a subgraph of the  
> delaunay
> triangulation, but I think it is easier to calculate the nearest  
> neighbours
> in the way I mentioned earlier because for the delaunay graph one  
> has to get
> the points and distances to all the other points anyway.
>
> Regards,
>
> Gabriel