mirror of
https://github.com/storytold/texturecraft.git
synced 2026-11-19 05:50:43 +01:00
- A box drag always finishes: on release (even after a failed move), before any edit, undo, redo or tool change, and when a scripted box fails or starts while another drag is open. A camera move mid-drag (wheel zoom) keeps the drag and selects again from the new camera. - A drag projects the mesh once, skips repaints whose box hasn't moved, and builds each grouping once; triangle edges are computed once. - 2D clicks read the triangle from the set's UV G-buffer at the clicked texel, so collapsed UV faces can't take the click. - Brush strokes no longer record the nearest-triangle buffer; only polygon fill asks for it (EyeDepth::render_with_triangles). Screen projection is shared through paint::screen_point. - A box touching the view's edge or zero-size on whole pixels selects exactly the pixels it covers. - Click fills never merge into a box drag's undo step; FillMode moves to its own file; partial box parameters get their own error.
84 lines
3.6 KiB
Rust
84 lines
3.6 KiB
Rust
//! Which polygons a polygon fill box selects.
|
|
|
|
use serde::{Deserialize, Serialize};
|
|
use texturecraft_geom::glam::Vec2;
|
|
|
|
/// How a polygon fill box decides whether it selects a polygon
|
|
#[derive(Clone, Copy, Debug, PartialEq, Eq, Serialize, Deserialize, Default)]
|
|
pub enum FillHitTest {
|
|
/// Any part of the polygon inside the box or crossing it
|
|
#[default]
|
|
Intersection,
|
|
/// The polygon's center point inside the box
|
|
ContainedCenter,
|
|
}
|
|
|
|
impl FillHitTest {
|
|
/// Whether the box from `low` to `high` selects the polygon made of `triangles` (their corners)
|
|
pub fn selects(self, triangles: &[[Vec2; 3]], low: Vec2, high: Vec2) -> bool {
|
|
match self {
|
|
FillHitTest::Intersection => triangles.iter().any(|corners| triangle_overlaps_box(*corners, low, high)),
|
|
FillHitTest::ContainedCenter => center(triangles).is_some_and(|point| point.cmpge(low).all() && point.cmple(high).all()),
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Area-weighted center of the triangles (their corners' mean when they have no area)
|
|
fn center(triangles: &[[Vec2; 3]]) -> Option<Vec2> {
|
|
if triangles.is_empty() {
|
|
return None;
|
|
}
|
|
|
|
// One pass: total area, area-weighted centroids and plain centroids
|
|
let (total_area, weighted, centroids) = triangles.iter().fold((0.0, Vec2::ZERO, Vec2::ZERO), |(total_area, weighted, centroids), corners| {
|
|
let area = (corners[1] - corners[0]).perp_dot(corners[2] - corners[0]).abs();
|
|
let centroid = (corners[0] + corners[1] + corners[2]) / 3.0;
|
|
(total_area + area, weighted + centroid * area, centroids + centroid)
|
|
});
|
|
Some(if total_area > 0.0 { weighted / total_area } else { centroids / triangles.len() as f32 })
|
|
}
|
|
|
|
/// Separating axis test of a triangle against an axis-aligned box
|
|
fn triangle_overlaps_box(corners: [Vec2; 3], low: Vec2, high: Vec2) -> bool {
|
|
let triangle_low = corners[0].min(corners[1]).min(corners[2]);
|
|
let triangle_high = corners[0].max(corners[1]).max(corners[2]);
|
|
if triangle_high.cmplt(low).any() || triangle_low.cmpgt(high).any() {
|
|
return false;
|
|
}
|
|
|
|
let box_corners = [low, Vec2::new(high.x, low.y), high, Vec2::new(low.x, high.y)];
|
|
(0..3).all(|edge| {
|
|
let axis = (corners[(edge + 1) % 3] - corners[edge]).perp();
|
|
let span = |points: &[Vec2]| points.iter().fold((f32::MAX, f32::MIN), |(min, max), point| (min.min(axis.dot(*point)), max.max(axis.dot(*point))));
|
|
let (triangle_min, triangle_max) = span(&corners);
|
|
let (box_min, box_max) = span(&box_corners);
|
|
triangle_max >= box_min && box_max >= triangle_min
|
|
})
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
|
|
const TRIANGLE: [Vec2; 3] = [Vec2::new(0.0, 0.0), Vec2::new(4.0, 0.0), Vec2::new(0.0, 4.0)];
|
|
|
|
#[test]
|
|
fn intersection_selects_any_overlap() {
|
|
assert!(FillHitTest::Intersection.selects(&[TRIANGLE], Vec2::splat(1.0), Vec2::splat(6.0)), "a box cutting the triangle");
|
|
assert!(!FillHitTest::Intersection.selects(&[TRIANGLE], Vec2::splat(3.0), Vec2::splat(5.0)), "inside the bounds, past the long edge");
|
|
}
|
|
|
|
#[test]
|
|
fn contained_center_selects_only_by_the_center() {
|
|
assert!(!FillHitTest::ContainedCenter.selects(&[TRIANGLE], Vec2::splat(2.0), Vec2::splat(6.0)), "the center (4/3, 4/3) lies outside");
|
|
assert!(FillHitTest::ContainedCenter.selects(&[TRIANGLE], Vec2::splat(1.0), Vec2::splat(2.0)));
|
|
}
|
|
|
|
#[test]
|
|
fn a_polygon_center_weighs_its_triangles_by_area() {
|
|
let square = [[Vec2::ZERO, Vec2::new(2.0, 0.0), Vec2::new(2.0, 2.0)], [Vec2::ZERO, Vec2::new(2.0, 2.0), Vec2::new(0.0, 2.0)]];
|
|
assert_eq!(center(&square), Some(Vec2::ONE));
|
|
assert_eq!(center(&[]), None);
|
|
}
|
|
}
|