Revision as of 00:33, 12 September 2019 edit Wpho (talk \| contribs) 1 edit →Example ← Previous edit		Revision as of 11:16, 27 November 2019 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,366 edits -predatory source Next edit →
Line 106: == Applications == * Segmentation and Clustering of a [[Binary image\|Binary Image]] <ref>{{cite web\|url=http://www.scialert.net/qredirect.php?doi=jas.2008.2474.2479&linkid=pdf \|format=PDF \|title=Journal of Applied Sciences \|issn=1812-5654 \|website=Scialert.net \|accessdate=2016-09-17}}</ref> * Determination of Nodal Domain Area and Nodal Line Lengths <ref>{{cite web\|url=https://webhome.weizmann.ac.il/home/feamit/nodalweek/c_joas_nodalweek.pdf \|format=PDF \|title=Introduction to the Hoshen-Kopelman algorithm and its application to nodal ___domain statistics \|author=Christian Joas \|website=Webhome.weizmann.ac.il \|accessdate=2016-09-17}}</ref> * [[Connectivity (graph theory)\|Nodal Connectivity Information]]

Hoshen–Kopelman algorithm: Difference between revisions