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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
//! Mean selection frontier.
use super::{neighbors, Frontier, Pixel};
use crate::color::{ColorSpace, Rgb8};
use crate::metric::soft::SoftKdForest;
use crate::metric::NearestNeighbors;
use std::iter;
use std::rc::Rc;
/// A pixel on a mean frontier.
#[derive(Debug)]
enum MeanPixel<C> {
Empty,
Fillable(Rc<Pixel<C>>),
Filled(C),
}
impl<C: ColorSpace> MeanPixel<C> {
fn filled_color(&self) -> Option<C> {
match self {
Self::Filled(color) => Some(*color),
_ => None,
}
}
}
/// A [Frontier] that looks at the average color of each pixel's neighbors.
pub struct MeanFrontier<C> {
pixels: Vec<MeanPixel<C>>,
forest: SoftKdForest<Rc<Pixel<C>>>,
width: u32,
height: u32,
len: usize,
deleted: usize,
}
impl<C: ColorSpace> MeanFrontier<C> {
/// Create a MeanFrontier with the given dimensions and initial pixel location.
pub fn new(width: u32, height: u32, x0: u32, y0: u32) -> Self {
let size = (width as usize) * (height as usize);
let mut pixels = Vec::with_capacity(size);
for _ in 0..size {
pixels.push(MeanPixel::Empty);
}
let pixel0 = Rc::new(Pixel::new(x0, y0, C::from(Rgb8::from([0, 0, 0]))));
let i = (x0 + y0 * width) as usize;
pixels[i] = MeanPixel::Fillable(pixel0.clone());
Self {
pixels,
forest: iter::once(pixel0).collect(),
width,
height,
len: 1,
deleted: 0,
}
}
fn pixel_index(&self, x: u32, y: u32) -> usize {
debug_assert!(x < self.width);
debug_assert!(y < self.height);
(x + y * self.width) as usize
}
fn fill(&mut self, x: u32, y: u32, color: C) {
let i = self.pixel_index(x, y);
match &self.pixels[i] {
MeanPixel::Empty => {}
MeanPixel::Fillable(pixel) => {
pixel.delete();
self.deleted += 1;
}
_ => unreachable!(),
}
self.pixels[i] = MeanPixel::Filled(color);
let mut pixels = Vec::new();
for &(x, y) in &neighbors(x, y) {
if x < self.width && y < self.height {
let i = self.pixel_index(x, y);
match &self.pixels[i] {
MeanPixel::Empty => {}
MeanPixel::Fillable(pixel) => {
pixel.delete();
self.deleted += 1;
}
MeanPixel::Filled(_) => continue,
}
let color = C::average(
neighbors(x, y)
.iter()
.filter(|(x, y)| *x < self.width && *y < self.height)
.map(|(x, y)| self.pixel_index(*x, *y))
.map(|i| &self.pixels[i])
.map(MeanPixel::filled_color)
.flatten(),
);
let pixel = Rc::new(Pixel::new(x, y, color));
self.pixels[i] = MeanPixel::Fillable(pixel.clone());
pixels.push(pixel);
}
}
self.len += pixels.len();
self.forest.extend(pixels);
if 2 * self.deleted >= self.len {
self.forest.rebuild();
self.len -= self.deleted;
self.deleted = 0;
}
}
}
impl<C: ColorSpace> Frontier for MeanFrontier<C> {
fn width(&self) -> u32 {
self.width
}
fn height(&self) -> u32 {
self.height
}
fn len(&self) -> usize {
self.len - self.deleted
}
fn place(&mut self, rgb8: Rgb8) -> Option<(u32, u32)> {
let color = C::from(rgb8);
let (x, y) = self.forest.nearest(&color).map(|n| n.item.pos)?;
self.fill(x, y, color);
Some((x, y))
}
}
|
