Recognizability of Polyhexes by Tiling and Wang Systems

Authors:
H. Geetha;D. G. Thomas;T. Kalyani;T. Robinson
Affiliations:
Department of Mathematics, St. Joseph's College of Engineering, Chennai 600119;Department of Mathematics, Madras Christian College, Chennai 600059;Department of Mathematics, St. Joseph's College of Engineering, Chennai 600119;Department of Mathematics, Madras Christian College, Chennai 600059
Venue:
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Year:
2009

Citing 4
Cited 0

Tiling the plane with one tile

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Monadic second-order logic over rectangular pictures and recognizability by tiling systems

Information and Computation
A method for the enumeration of various classes of column-convex polygons

Discrete Mathematics
Wang Tiles for image and texture generation

ACM SIGGRAPH 2003 Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The polyhexes are the hexagonal polyominoes on the honeycomb lattice. In this paper we define various types of polyhexes and show that various classes of column (row) polyhexes can be naturally represented as two dimensional words of tiling recognizable languages. We prove the recognizability of polyhexes through Wang tiles and obtain the result that the classes of polyhexes recognized by hexagonal tiling and hexagonal Wang tiles are equivalent.