Eonfusion dataflow-based tutorial: basic tracks - General - Using Eonfusion

Not logged in - Login | Register

Eonfusion forum > Using Eonfusion > General > Eonfusion dataflow-based tutorial: basic tracks

-> Eonfusion web site
-> Eonfusion manual

Eonfusion dataflow-based tutorial: basic tracks

Moderated by: forumadmin

New Topic

Author

Post

Matt Wilson
Internal

Joined:	Tue Aug 12th, 2008
Location:	Hobart, Australia
Posts:	66
Status:	Offline
Mana:

Posted: Thu May 7th, 2009 06:40 am

Quote

Tutorial: basic tracks

Level: beginner

Link: http://eonfusion2.myriax.com/fsh/details.php?id=72

Issued: 7th May 2009. Revised for V2.0, 7th October 2009.

Summary: A simple Eonfusion dataflow that reads a list of points from a tabular text data source and converts them into track features. Tracks, points and an artificially generated bottom surface are viewed in 4D.

Useful for understanding:

Last edited on Wed Oct 7th, 2009 03:59 am by Matt Wilson

gtg194v
Member

Joined:	Mon Nov 2nd, 2009
Location:
Posts:	2
Status:	Offline
Mana:

Posted: Wed Nov 4th, 2009 05:33 pm

Quote

Thanks for the tutorial. I on working a project silimar to your Antartic krill example, and I was wondering 2 things:

(1) how you can calculate the nearest neighbor distance of easch memeber in a school of krill and can you show the nearest neighbor distance of each krill in the scene.

(2) how do I calculate the distance between each krill member in a school.

Any help will be appreciated. GW

Warwick Gillespie
Internal

Joined:	Wed Nov 5th, 2008
Location:	Hobart, Australia
Posts:	26
Status:	Offline
Mana:

Posted: Thu Nov 5th, 2009 04:03 am

Quote

Hi,

I have uploaded a section of dataflow (http://eonfusion2.myriax.com/fsh/details.php?id=80) that makes use of the Link neighbouring vertices operator - a new feature in v2.0, that I hope will meet your needs.

The dataflow contains 3 operators:

1. Link neighbouring vertices - creates a link from each vertex to all the vertices within a defined distance (in X,Y,Z and T in this case). Note in this case the distance in T is set to 0 so that links are only created to vertices with the same time value

2. An evaluate expression operator that iterates through all the links to determine which vertex in the neighbourhood is the closest, and stores the distance to the closest neighbour and the index of the closest neighbour.

3. A Join operator that creates an link from the current vertex to the closest vertex (using the index of the closest neighbour calculated previously).

You should be able to modify this dataflow to suit your application.

If you dont have v2.0 yet, please contact support@eonfusion.com

cheers

Warwick

Eonfusion Support

gtg194v
Member

Joined:	Mon Nov 2nd, 2009
Location:
Posts:	2
Status:	Offline
Mana:

Posted: Wed Nov 18th, 2009 04:42 pm

Quote

thx

Current time is 04:43 am