use crate::common::PCoords;
use crate::common::points::barycentric;
use crate::raster2::RasterMapping;
use crate::{Point2, Result, Vector2};
use parry2d_f64::partitioning::TraversalAction;
use parry2d_f64::query::{PointQuery, PointQueryWithLocation};
use parry2d_f64::shape::TriMesh;
#[derive(Clone)]
pub struct UvMapping {
tri_map: TriMesh,
}
impl UvMapping {
pub fn new(vertices: Vec<Point2>, faces: Vec<[u32; 3]>) -> Result<Self> {
let tri_map = TriMesh::new(vertices, faces)?;
Ok(Self { tri_map })
}
pub fn at_closest_uv(&self, point: &impl PCoords<2>) -> (u32, Point2) {
let p = Point2::from(point.coords());
let result = self.tri_map.project_local_point_and_get_location(&p, false);
let (proj, (t_id, _)) = result;
(t_id, Point2::new(proj.point.x, proj.point.y))
}
pub fn faces(&self) -> &[[u32; 3]] {
self.tri_map.indices()
}
pub fn point(&self, tri_id: u32, barycentric: [f64; 3]) -> Point2 {
let tri = self.tri_map.triangle(tri_id);
let p = tri.a.coords * barycentric[0]
+ tri.b.coords * barycentric[1]
+ tri.c.coords * barycentric[2];
Point2::from(p)
}
pub fn triangle(&self, point: &Point2) -> Option<(u32, [f64; 3])> {
let mut result: Option<(u32, [f64; 3])> = None;
self.tri_map.bvh().traverse(|node| {
if !node.aabb().contains_local_point(point) {
return TraversalAction::Prune;
}
if let Some(index) = node.leaf_data() {
let tri = self.tri_map.triangle(index);
if tri.contains_local_point(point) {
let bc = barycentric(&tri.a, &tri.b, &tri.c, point);
result = Some((index, bc));
return TraversalAction::EarlyExit;
}
}
TraversalAction::Continue
});
result
}
pub fn make_raster_mapping(&self, px_size: f64, padding: usize) -> RasterMapping {
let origin: Point2 = self.tri_map.local_aabb().mins;
let max = self.tri_map.local_aabb().maxs;
let size = max - origin;
let width_px = (size.x / px_size).ceil() as usize + padding * 2;
let height_px = (size.y / px_size).ceil() as usize + padding * 2;
let pad = padding as f64 * px_size;
let padded_origin = origin - Vector2::new(pad, pad);
RasterMapping::new(padded_origin, (height_px, width_px), px_size, None)
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::common::points::mean_point;
use approx::assert_relative_eq;
#[test]
fn uv_mapping_bc_works() {
let vertices = vec![
Point2::new(0.0, 0.0),
Point2::new(1.0, 0.0),
Point2::new(0.0, 1.0),
];
let faces = vec![[0, 1, 2]];
let test_point = mean_point(&vertices);
let uv_mapping = UvMapping::new(vertices, faces).unwrap();
let (tri_id, bary) = uv_mapping.triangle(&test_point).unwrap();
assert_eq!(tri_id, 0);
assert_relative_eq!(bary[0], 1.0 / 3.0, epsilon = 1e-6);
assert_relative_eq!(bary[1], 1.0 / 3.0, epsilon = 1e-6);
assert_relative_eq!(bary[2], 1.0 / 3.0, epsilon = 1e-6);
}
#[test]
fn uv_mapping_miss() {
let vertices = vec![
Point2::new(0.0, 0.0),
Point2::new(1.0, 0.0),
Point2::new(0.0, 1.0),
];
let faces = vec![[0, 1, 2]];
let test_point = Point2::new(2.0, 2.0); let uv_mapping = UvMapping::new(vertices, faces).unwrap();
assert!(uv_mapping.triangle(&test_point).is_none());
}
}