The packing problem : A divide and conquer algorithm on cellular automata - GREYC amacc Access content directly
Conference Papers Year : 2012

The packing problem : A divide and conquer algorithm on cellular automata

Abstract

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.
Fichier principal
Vignette du fichier
divide_and_conquer_packing.pdf (94.47 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-00957117 , version 1 (08-03-2014)

Identifiers

  • HAL Id : hal-00957117 , version 1

Cite

Nicolas Bacquey. The packing problem : A divide and conquer algorithm on cellular automata. Automata & JAC 2012, Sep 2012, Cargese, France. pp.1-10. ⟨hal-00957117⟩
117 View
174 Download

Share

Gmail Facebook X LinkedIn More