THE SHORTEST CONNECTION PROBLEM ON TRIANGULAR GRIDS

Author(s):  
Jie Mei ◽  
Edmund A. Lamagna
2010 ◽  
Vol 234 (4) ◽  
pp. 1027-1035 ◽  
Author(s):  
Francisco Gaspar ◽  
J.L. Gracia ◽  
F.J. Lisbona ◽  
C. Rodrigo

2021 ◽  
Vol 31 (01) ◽  
pp. 2150014
Author(s):  
Barbara Wolnik ◽  
Maciej Dziemiańczuk ◽  
Bernard De Baets

We present counterexamples illustrating that the characterization of the reversibility of linear cellular automata on finite triangular grids given by Uguz et al. [2017] and Uguz et al. [2019] is not valid, neither in the case of null boundary conditions nor in the case of periodic boundary conditions.


Sign in / Sign up

Export Citation Format

Share Document