An interactive program has been developed to assist in the design of new goniochromatic colors. The program gives the user a unique set of controls over a second order polynomial ...
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
Elif E. Ayiter, Selim Balcisoy, Murat Germen, Isma...
This work concentrates on the problem of watermarking embedding and optimum detection in color images through the use of spread spectrum techniques, both in space (Direct Sequence...