Redelmeier's algorithm for counting lattice animals

Gadi Aleksandrowicz; Gill Barequet

doi:10.1145/1998196.1998238

Redelmeier's algorithm for counting lattice animals

Gadi Aleksandrowicz, Gill Barequet

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this video we present Redelmeier's algorithm for counting polyominoes, its generalization for counting animals on any lattice, and our implementation of a parallel version of it.

Original language	English
Title of host publication	Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11
Pages	283-284
Number of pages	2
DOIs	https://doi.org/10.1145/1998196.1998238
State	Published - 2011
Event	27th Annual ACM Symposium on Computational Geometry, SCG'11 - Paris, France Duration: 13 Jun 2011 → 15 Jun 2011

Publication series

Name	Proceedings of the Annual Symposium on Computational Geometry

Conference

Conference	27th Annual ACM Symposium on Computational Geometry, SCG'11
Country/Territory	France
City	Paris
Period	13/06/11 → 15/06/11

Keywords

Polycubes
Polyominoes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Access to Document

10.1145/1998196.1998238

Cite this

@inproceedings{d2ab82b9b242465782836113bc690f69,

title = "Redelmeier's algorithm for counting lattice animals",

abstract = "In this video we present Redelmeier's algorithm for counting polyominoes, its generalization for counting animals on any lattice, and our implementation of a parallel version of it.",

keywords = "Polycubes, Polyominoes",

author = "Gadi Aleksandrowicz and Gill Barequet",

year = "2011",

doi = "10.1145/1998196.1998238",

language = "الإنجليزيّة",

isbn = "9781450306829",

series = "Proceedings of the Annual Symposium on Computational Geometry",

pages = "283--284",

booktitle = "Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11",

note = "27th Annual ACM Symposium on Computational Geometry, SCG'11 ; Conference date: 13-06-2011 Through 15-06-2011",

}

Aleksandrowicz, G & Barequet, G 2011, Redelmeier's algorithm for counting lattice animals. in Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11. Proceedings of the Annual Symposium on Computational Geometry, pp. 283-284, 27th Annual ACM Symposium on Computational Geometry, SCG'11, Paris, France, 13/06/11. https://doi.org/10.1145/1998196.1998238

TY - GEN

T1 - Redelmeier's algorithm for counting lattice animals

AU - Aleksandrowicz, Gadi

AU - Barequet, Gill

PY - 2011

Y1 - 2011

N2 - In this video we present Redelmeier's algorithm for counting polyominoes, its generalization for counting animals on any lattice, and our implementation of a parallel version of it.

AB - In this video we present Redelmeier's algorithm for counting polyominoes, its generalization for counting animals on any lattice, and our implementation of a parallel version of it.

KW - Polycubes

KW - Polyominoes

UR - http://www.scopus.com/inward/record.url?scp=79960178762&partnerID=8YFLogxK

U2 - 10.1145/1998196.1998238

DO - 10.1145/1998196.1998238

M3 - منشور من مؤتمر

SN - 9781450306829

T3 - Proceedings of the Annual Symposium on Computational Geometry

SP - 283

EP - 284

BT - Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11

T2 - 27th Annual ACM Symposium on Computational Geometry, SCG'11

Y2 - 13 June 2011 through 15 June 2011

ER -

Redelmeier's algorithm for counting lattice animals

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this