How it works: Connectivity constraints?

[Эрвин Визард]

Dear colleagues,

Could you, please, share code part corresponding to the Morpgeus Local Connectivity Constraints or explain why a little bit strange conditions from Merks & Glazier 2006 leads to real Global Connectivity?

I attached really not obvious pictures from referred paper and the condition on the local neighboring patches. But doesn't help to understand real principles of connectivity work.

[Эрвин Визард]

It is strange but in html-version of this paper you may find other version of such condition (+ condition of 3 different cell types in the local neighborhood):

четверг, 18 ноября 2021 г. в 20:46:00 UTC+3, Эрвин Визард:

[Jörn Starruss]

Dear Erwin,

probably Morpheus does not use exactly the logics Roeland Marks used. We just demand the direct neighborhood (Moore for square lattices) has only one single connected section of each cell, such that it's not possible to split up or merge connected branches of any cell.

the code is here

https://gitlab.com/morpheus.lab/morpheus/-/blob/master/morpheus/plugins/shape/connectivity_constraint.cpp#L99

Best, Joern

Btw. Make sure to use at least version 2.2.5 of the 2.2 series, since we had a regression in earlier versions.

Am 19.11.21 um 23:31 schrieb Эрвин Визард:

--
You received this message because you are subscribed to the Google Groups "Morpheus users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to morpheus-user...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/morpheus-users/04ae2801-f54d-4778-b9d2-c0a00258a1ecn%40googlegroups.com.

-- 
--------------
Jörn Starruß
Tel +49 351 463 38554
APB 1026

Technische Universität Dresden
Zentrum für Informationsdienste und Hochleistungsrechnen (ZIH)
Abteilung Innovative Methoden des Computing