Towards an Algorithmic Guide to Spiral Galaxies

Abstract : In this paper, we are interested in the one-player game Spiral Galaxies, and study it from an algorithmic viewpoint. Spiral Galaxies has been shown to be NP-hard [Friedman, 2002] more than a decade ago, but so far it seems that no one has dared exploring its algorithmic universe. We take this trip and visit some of its corners.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01044934
Contributor : Guillaume Fertin <>
Submitted on : Thursday, July 24, 2014 - 12:54:18 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Document(s) archivé(s) le : Tuesday, April 11, 2017 - 5:52:47 PM

File

galaxies.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies. Seventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Jul 2014, Lipari, Italy. pp.171-182, ⟨10.1007/978-3-319-07890-8_15⟩. ⟨hal-01044934⟩

Share

Metrics

Record views

152

Files downloads

242