Graph encoding of 2D-gon tilings
From MaRDI portal
Publication:2581345
DOI10.1016/J.TCS.2005.08.018zbMATH Open1081.68067OpenAlexW1982314328MaRDI QIDQ2581345FDOQ2581345
Authors: Frédéric Chavanon, Matthieu Latapy, M. Morvan, Eric Rémila, L. Vuillon
Publication date: 10 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.018
Recommendations
Cites Work
- Lectures on Polytopes
- Oriented Matroids
- The undecidability of the domino problem
- Tiling a polygon with parallelograms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- On the cocircuit graph of an oriented matroid
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Title not available (Why is that?)
- Arctic octahedron in three-dimensional rhombus tilings and related integer solid partitions
- Coherence and enumeration of tilings of 3-zonotopes
Cited In (1)
This page was built for publication: Graph encoding of 2D-gon tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581345)