1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*************************************************************************
* Copyright (C) 2010 Tavian Barnes <tavianator@gmail.com> *
* *
* This file is part of The Dimension Library. *
* *
* The Dimension Library is free software; you can redistribute it and/ *
* or modify it under the terms of the GNU Lesser General Public License *
* as published by the Free Software Foundation; either version 3 of the *
* License, or (at your option) any later version. *
* *
* The Dimension Library is distributed in the hope that it will be *
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty *
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this program. If not, see *
* <http://www.gnu.org/licenses/>. *
*************************************************************************/
#include "dimension.h"
/*
* Color-mapped patterned pigments
*/
typedef struct dmnsn_color_map_entry {
double n;
dmnsn_color color;
} dmnsn_color_map_entry;
dmnsn_color_map *
dmnsn_new_color_map()
{
return dmnsn_new_array(sizeof(dmnsn_color_map_entry));
}
void
dmnsn_delete_color_map(dmnsn_color_map *map)
{
dmnsn_delete_array(map);
}
void
dmnsn_add_color_map_entry(dmnsn_color_map *map, double n, dmnsn_color c)
{
dmnsn_color_map_entry entry = { .n = n, .color = c };
/* Sorted insertion */
ssize_t i;
dmnsn_color_map_entry *other = dmnsn_array_last(map);
for (i = dmnsn_array_size(map) - 1; i >= 0; --i, --other) {
if (other->n <= n)
break;
}
dmnsn_array_insert(map, i + 1, &entry);
}
dmnsn_color
dmnsn_color_map_value(const dmnsn_color_map *map, double n)
{
dmnsn_color_map_entry *entry = dmnsn_array_first(map);
double n1, n2 = 0.0;
dmnsn_color c1, c2 = entry->color;
for (; entry <= (dmnsn_color_map_entry *)dmnsn_array_last(map); ++entry) {
n1 = n2;
c1 = c2;
n2 = entry->n;
c2 = entry->color;
if (n < n2) {
return dmnsn_color_gradient(c1, c2, (n - n1)/(n2 - n1));
}
}
return c2;
}
typedef struct dmnsn_color_map_payload {
dmnsn_pattern *pattern;
dmnsn_color_map *map;
} dmnsn_color_map_payload;
static dmnsn_color
dmnsn_color_map_pigment_fn(const dmnsn_pigment *pigment, dmnsn_vector v)
{
const dmnsn_color_map_payload *payload = pigment->ptr;
return dmnsn_color_map_value(payload->map,
dmnsn_pattern_value(payload->pattern, v));
}
static void
dmnsn_color_map_init_fn(dmnsn_pigment *pigment)
{
dmnsn_color_map_payload *payload = pigment->ptr;
payload->pattern->trans = dmnsn_matrix_mul(pigment->trans,
payload->pattern->trans);
dmnsn_pattern_init(payload->pattern);
}
dmnsn_pigment *
dmnsn_new_color_map_pigment(dmnsn_pattern *pattern, dmnsn_color_map *map)
{
dmnsn_pigment *pigment = dmnsn_new_pigment();
dmnsn_color_map_payload *payload
= dmnsn_malloc(sizeof(dmnsn_color_map_payload));
payload->pattern = pattern;
payload->map = map;
pigment->pigment_fn = &dmnsn_color_map_pigment_fn;
pigment->init_fn = &dmnsn_color_map_init_fn;
pigment->free_fn = &dmnsn_free;
pigment->ptr = payload;
return pigment;
}
|
