use super::HalfEdgeMesh3;
use crate::common::points::dist;
use crate::{Iso3, Point3, Result, SvdBasis3};
use alum::{Handle, HasIterators, HasTopology};
impl HalfEdgeMesh3 {
pub fn neighborhood_smooth(&mut self) -> Result<()> {
let mesh = &mut self.inner;
let vertices = mesh.vertices().collect::<Vec<_>>();
let mut adjusted = Vec::new();
for vh in vertices {
let this_point: Point3 = mesh
.point(vh)
.map_err(|e| format!("Failed to get point for vertex {}: {:?}", vh.index(), e))?
.into();
let mut neighbors = Vec::new();
for he in mesh.voh_ccw_iter(vh) {
let neighbor_point: Point3 = mesh
.point(he.head(mesh))
.map_err(|e| {
format!("Failed to get point for half-edge {}: {:?}", he.index(), e)
})?
.into();
neighbors.push((neighbor_point, dist(&this_point, &neighbor_point)));
}
if neighbors.len() < 3 {
continue; }
let mut n_points: Vec<Point3> = neighbors.iter().map(|(p, _)| *p).collect();
n_points.push(this_point);
let Some(basis) = SvdBasis3::from_points(&n_points, None) else {
continue;
};
let t = Iso3::from(&basis);
let transformed = n_points.iter().map(|p| t * p).collect::<Vec<_>>();
let avg_z = transformed.iter().map(|p| p.z).sum::<f64>() / transformed.len() as f64;
let t_point = t * this_point;
let new_point = t.inverse() * Point3::new(t_point.x, t_point.y, avg_z);
adjusted.push((vh, new_point));
}
for (vh, new_point) in adjusted {
mesh.set_point(vh, new_point.coords)
.map_err(|e| format!("Failed to set point for vertex {}: {:?}", vh.index(), e))?;
}
Ok(())
}
}