Abstract
The paper bounds the number of tessellations with T-shaped vertices on a fixed set of lines: tessellations are efficiently encoded, and algorithms retrieve them, proving injectivity. This yields existence of a completely random T-tessellation, as defined by Kiên Kiêu et al., and of its Gibbsian modifications. The combinatorial bound is sharp, but likely pessimistic in typical cases.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.