use crate::raster2::Point2I;
use crate::raster2::raster_mask::RasterMask;
pub fn zhang_suen_thinning(mask: &mut RasterMask) {
let mut zhang_suen = ZhangSuen::new(mask);
while zhang_suen.zhang_suen_iter() {}
}
struct ZhangSuen<'a> {
mask: &'a mut RasterMask,
}
impl<'a> ZhangSuen<'a> {
fn new(mask: &'a mut RasterMask) -> Self {
Self { mask }
}
fn zhang_suen_a(&self, p: Point2I) -> i32 {
let neighbor_values = zhang_suen_neighbors(p)
.iter()
.map(|p| self.mask.get_point(*p))
.collect::<Vec<_>>();
let mut count = 0;
for i in 0..neighbor_values.len() {
let j = (i + 1) % neighbor_values.len();
if !neighbor_values[i] && neighbor_values[j] {
count += 1;
}
}
count
}
fn zhang_suen_b(&self, p: Point2I) -> i32 {
zhang_suen_neighbors(p)
.iter()
.map(|p| self.mask.get_point(*p))
.filter(|x| *x)
.count() as i32
}
fn zhang_suen_c(&self, p: Point2I, a: usize, b: usize, c: usize) -> bool {
let neighbor_values = zhang_suen_neighbors(p)
.iter()
.map(|p| self.mask.get_point(*p))
.collect::<Vec<_>>();
!neighbor_values[a - 2] || !neighbor_values[b - 2] || !neighbor_values[c - 2]
}
pub fn zhang_suen_iter(&mut self) -> bool {
let mut to_delete_1 = Vec::new();
for p in self.mask.iter_true() {
let a = self.zhang_suen_a(p);
let b = self.zhang_suen_b(p);
if !(2..=6).contains(&b) || a != 1 {
continue;
}
if !self.zhang_suen_c(p, 2, 4, 6) {
continue;
}
if !self.zhang_suen_c(p, 4, 6, 8) {
continue;
}
to_delete_1.push(p);
}
for p in to_delete_1.iter() {
self.mask.set_point_if_in_bounds(*p, false);
}
let mut to_delete_2 = Vec::new();
for p in self.mask.iter_true() {
let a = self.zhang_suen_a(p);
let b = self.zhang_suen_b(p);
if !(2..=6).contains(&b) || a != 1 {
continue;
}
if !self.zhang_suen_c(p, 2, 4, 8) {
continue;
}
if !self.zhang_suen_c(p, 2, 6, 8) {
continue;
}
to_delete_2.push(p);
}
for p in to_delete_2.iter() {
self.mask.set_point_if_in_bounds(*p, false);
}
!to_delete_1.is_empty() || !to_delete_2.is_empty()
}
}
fn zhang_suen_neighbors(p: Point2I) -> [Point2I; 8] {
[
Point2I::new(p.x, p.y - 1),
Point2I::new(p.x + 1, p.y - 1),
Point2I::new(p.x + 1, p.y),
Point2I::new(p.x + 1, p.y + 1),
Point2I::new(p.x, p.y + 1),
Point2I::new(p.x - 1, p.y + 1),
Point2I::new(p.x - 1, p.y),
Point2I::new(p.x - 1, p.y - 1),
]
}
#[cfg(test)]
mod tests {
use super::*;
use crate::Result;
use crate::raster2::raster_mask::RasterMask;
fn sample_to_mask(input: Vec<&str>) -> Result<RasterMask> {
let height = input.len();
let width = input[0].len();
let mut mask = RasterMask::empty(width as u32, height as u32);
for (y, line) in input.iter().enumerate() {
for (x, c) in line.chars().enumerate() {
if c == '#' {
mask.set_point(Point2I::new(x as i32, y as i32), true)?;
}
}
}
Ok(mask)
}
#[test]
fn rosetta_code_sample() -> Result<()> {
let input = vec![
"................................",
".#########.......########.......",
".###...####.....####..####......",
".###....###.....###....###......",
".###...####.....###.............",
".#########......###.............",
".###.####.......###....###......",
".###..####..###.####..####.###..",
".###...####.###..########..###..",
"................................",
];
let expected = vec![
"................................",
"..#######.........######........",
"..#.....#........##.............",
"..#......#.......#..............",
"..#.....#........#..............",
"..#####.#........#..............",
".......##........#..............",
"........#....#...##....##...#...",
".........#.........####.........",
"................................",
];
let mut input = sample_to_mask(input)?;
let expected = sample_to_mask(expected)?;
zhang_suen_thinning(&mut input);
assert_eq!(expected.count_true(), input.count_true());
for p in expected.iter_all() {
assert_eq!(
input.get_point(p),
expected.get_point(p),
"Pixel mismatch at {:?}",
p
);
}
Ok(())
}
}