Algorithms for color analysis

Authors:
J. A. Hoskins;W. D. Hoskins;J. L. W. May
Affiliations:
Dept. of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada;-;Dept. of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada
Venue:
Proceedings of the 1985 ACM SIGSMALL symposium on Small systems
Year:
1985

Citing 5
Cited 0

Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
Data Structures and Algorithms

Data Structures and Algorithms
Loom-constrained designs: An algebraic solution

ACM '69 Proceedings of the 1969 24th national conference
Algorithms for the design and analysis of woven textiles

SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
On-line textile designing

ACM '66 Proceedings of the 1966 21st national conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The usual algorithms for the analysis and synthesis of woven textile structures assume, in general, that the interlacement data is binary, and that this data corresponds on a one-to-one basis with the visible pattern exhibited by a cloth constructed of just two colors. As soon as this two-valued restriction is lifted and the data array is permitted to contain an arbitrary number of colors, the analysis algorithm becomes considerably more complicated. Three classes of solutions now become possible. The form of this algorithm, the solutions, and the necessary implications for the architecture of the user interface are examined and an implementation is discussed.