conference-paper
Compact Polyominoes
Research footprint
At a glance
- Citations
- 1
- References
- 6
- Comments
- 0
Paper overview
Abstract
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
Record transparency
Publication details
- DOI
- 10.1109/dcc50243.2021.00088
- OpenAlex
- W3165743633
- Document type
- conference-paper
- Language
- EN
- Last metadata update
Comments
Log in to join the discussion.