Thanks Willem and George,


To clarify,
The network needs to be walkable between "near" nodes.
So, links can cross each other.
ie. I'm not looking for a minimal spanning tree

But there can be too many links to a node as well.

I'm currently checking the angle between links, if it's small
I throw away the link to the node further away.
This works ok for nodes that aren't close.
When they are close, the angles are larger and I can't trim them.


Thanks for your ideas!

Mark



On Thu, May 15, 2008 at 1:03 PM, George van Venrooij <george@organicvectory.com> wrote:
Perhaps you mean something like this: http://vast.sourceforge.net (the
algorithm behind it, not the library itself).

Regards,

 George


>   Hi all,
>
>
>   I have a network of nodes that are connected.
>   So far they are connected based just on distance, which is too much.
>
>   How can I best filter out the extra connections?
>
>   I thought of keeping the closest links in the most diverse directions by
>   - group them based on angle, up to eight groups
>   - keep only the closest in each group
>
>   How can I group them?  Creating the intervals sounds a bit like a
> skip list.
>
>   Wish I had my old Tanenbaum book here, this must have been handled
>   in networking before.
>
>
>   cheers,
>
>   Mark
>
>
>
>
>
> ------------------------------------------------------------------------------
>
>
>   -------------------------------------------------------------------------
>   This SF.net email is sponsored by: Microsoft
>   Defy all challenges. Microsoft(R) Visual Studio 2008.
>   http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
>
>
> ------------------------------------------------------------------------------
>
>
>   _______________________________________________
>   GDAlgorithms-list mailing list
>   GDAlgorithms-list@lists.sourceforge.net
>   https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
>   Archives:
>   http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list




-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
GDAlgorithms-list mailing list
GDAlgorithms-list@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list