Results on Hexagonal Tile Rewriting Grammars

Authors:
D. G. Thomas;F. Sweety;T. Kalyani
Affiliations:
Department of Mathematics, Madras Christian College, Chennai, 600 059;Department of Mathematics, St. Joseph's College of Engineering, Chennai, 600 119;Department of Mathematics, St. Joseph's College of Engineering, Chennai, 600 119
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Year:
2008

Citing 9
Cited 0

An algorithmic comparison between square- and hexagonal-based grids

CVGIP: Graphical Models and Image Processing
Thinning algorithms on rectangular, hexagonal, and triangular arrays

Communications of the ACM
Tile rewriting grammars and picture languages

Theoretical Computer Science - The art of theory
Picture languages: tiling systems versus tile rewriting grammars

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Analytical Honeycomb Geometry for Raster and Volume Graphics

The Computer Journal
Distance on a Hexagonal Grid

IEEE Transactions on Computers
Collage of Hexagonal Arrays

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Tile rewriting grammars

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Hexagonal pattern languages

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis

Quantified Score

Hi-index	0.02

Visualization

Abstract

Tile rewriting grammars are a new model for defining picture languages. In this paper we propose hexagonal tile rewriting grammars (HTRG) for generating hexagonal picture languages. Closure properties of HTRG are proved for some basic operations. We compare HTRG with hexagonal tiling systems.