The packing problem : A divide and conquer algorithm on cellular automata
Résumé
This paper introduces a new algorithm to deal with the packing problem on cellular automata of di- mension 2 in linear time complexity; which means O(n) for an input square picture of size n × n. We use a divide and conquer approach to achieve this linear time complexity. This algorithm pre- serves the black cells at each step of the algorithm, i.e. only moves them, which was the main design flaw in previous algorithms.
Origine : Accord explicite pour ce dépôt
Loading...