Difference between revisions of "How to write your own particlelinking algorithm for TrackMate"
(Created page with "== Introduction. == This last part on particlelinking modules concludes the series of tutorials on extending TrackMate. The most difficult modules to create are spot detecto...") 
(→Introduction.) 

Line 1:  Line 1:  
+  {{ExtendingTrackMateTutorials}}  
+  
== Introduction. ==  == Introduction. ==  
This last part on particlelinking modules concludes the series of tutorials on extending TrackMate. The most difficult modules to create are spot detectors, which was the subject of the [[How to write your own detection algorithm for TrackMateprevious tutorial]]. Particlelinking modules, or trackers, are a little bit less complicated.  This last part on particlelinking modules concludes the series of tutorials on extending TrackMate. The most difficult modules to create are spot detectors, which was the subject of the [[How to write your own detection algorithm for TrackMateprevious tutorial]]. Particlelinking modules, or trackers, are a little bit less complicated.  
−  However, you still need to understand how we store and manipulate links in TrackMate, and this implies very briefly introducing mathematical graphs.  +  However, you still need to understand how we store and manipulate links in TrackMate, and this implies very briefly introducing mathematical graphs. 
−  
== Simple, undirected graphs. ==  == Simple, undirected graphs. == 
Revision as of 07:56, 29 August 2014
Extending TrackMate  


Introduction.
This last part on particlelinking modules concludes the series of tutorials on extending TrackMate. The most difficult modules to create are spot detectors, which was the subject of the previous tutorial. Particlelinking modules, or trackers, are a little bit less complicated.
However, you still need to understand how we store and manipulate links in TrackMate, and this implies very briefly introducing mathematical graphs.