We consider a version of the on-line graph coloring problem as a two person game. Players are called Spoiler and Painter. Spoiler reveals a graph by putting or removing a node. But at each time the total number of nodes on the board is bounded by previously fixed constant n. Painter must assign a color to any new node such that two nodes connected by an edge have different colors. He cannot cha...

The prints of Sebald Beham and his brother Barthel were the subject of a recent exhibition titled Gottlosen Maler at the AlbrechtDűrer-Haus in Nuremberg (March 3–July 3, 2011), where this essay was included in the exhibition catalogue in German. Revised and expanded for publication in this journal in English, the essay addresses Beham’s biography and historiography and argues that Beham should ...

This paper presents a method for painting texture interactively on a 3D model. Unlike some previously published methods, the technique presented here does not require a grid topology and does not require a dense mesh. The resolution of the texture map produced is independent of the density of the geometry. We also discuss the application in a 3D application of various brushes traditional to 2D ...