Collage of Hexagonal Arrays

Authors:
F. Sweety;D. G. Thomas;T. Kalyani
Affiliations:
Department of Mathematics, St. Joseph's College of Engineering, Chennai 600 119;Department of Mathematics, Madras Christian College, Chennai 600 059;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, Part II
Year:
2008

Citing 8
Cited 1

An algorithmic comparison between square- and hexagonal-based grids

CVGIP: Graphical Models and Image Processing
Two-dimensional languages

Handbook of formal languages, vol. 3
A characterization of recognizable picture languages by tilings by finite sets

Theoretical Computer Science - Special issue on Caen '97
Thinning algorithms on rectangular, hexagonal, and triangular arrays

Communications of the ACM
Collage of two-dimensional words

Theoretical Computer Science - The art of theory
Analytical Honeycomb Geometry for Raster and Volume Graphics

The Computer Journal
Distance on a Hexagonal Grid

IEEE Transactions on Computers
Hexagonal pattern languages

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

Results on Hexagonal Tile Rewriting Grammars

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new operation called collage on one-dimensional (respectively two-dimensional) word languages was introduced in [2]. It is obtained by piling up, one on top of the other, words of a given recognizable language on a previously empty one-dimensional (respectively two-dimensional) array. In this paper we extend this operation to hexagonal picture languages, and show that if P is a hexagonal picture language over one letter alphabet then Collage (P ) is recognizable.