# Tag Archives: programming

## Smoothing images

The image quality suffers if the mapping functions X(x,y) and Y(x,y) of the position (x,y) of a pixel of the output image to the position (X,Y) of the sampled input image pixel are strongly contracting or expanding. For contracting mappings … Continue reading

Posted in Kaleidoscopes, programming | | 1 Comment

## Better images from higher harmonics ?

Maybe you have noticed that a lot of round shapes without details in the recent images of this blog. They resemble bulls-eyes. Here is an example: It’s a periodic image with square symmetry and no mirror symmetry. Its big grey … Continue reading

## Changing the hue

It has been easy to find special color transformations for 2- and 3-color symmetries. For other color symmetries I use a rather general color transformation that changes the hue. First, we separate the pixel color in a grey part and … Continue reading

## n-fold color symmetry

Let’s begin with a simple kaleidoscope, where a pixel at coordinates z=x+iy has the original colors of an input image at the mapped coordinates Z(z)=X(x,y)+iY(x,y). It has some symmetry s. It is a mapping of the plane that does not … Continue reading

## Kaleidoscopes with twofold color symmetry.

A checkerboard is a square lattice with twofold color symmetry. The alternating black and white squares make it more interesting than a simple square lattice. Thus I want to have too some twofold color symmetry for our kaleidoscopes. Farris has done this … Continue reading