use std::collections::BTreeSet;
use crate::{
blend::{self, EdgeName, has_name},
boolean,
error::Result,
math::Point3,
topo::{Brep, EdgeId, FaceId},
};
pub fn faces_named(body: &Brep, name: &str) -> BTreeSet<FaceId> {
let carriers: Vec<FaceId> = body
.face_ids()
.filter(|&f| has_name(body, f, name))
.collect();
body.face_ids()
.filter(|&f| {
carriers.iter().any(|&c| {
c == f || boolean::same_domain(&body.face(c).surface, &body.face(f).surface)
})
})
.collect()
}
pub fn convex_edges(b: &Brep) -> Result<Vec<EdgeId>> {
let outward = |f: FaceId, p: Point3| {
let s = &b.face(f).surface;
let uv = s.project(p);
let n = s.normal(uv.x, uv.y);
if b.face(f).reversed { -n } else { n }
};
let mut out = Vec::new();
for e in b.edge_ids() {
let edge = b.edge(e);
let Some(c) = &edge.curve else { continue };
let uses: Vec<_> = b.coedge_ids().filter(|&o| b.coedge(o).edge == e).collect();
let [cf, cg] = uses[..] else { continue };
let (f, g) = (b.coedge_face(cf), b.coedge_face(cg));
if f == g {
continue;
}
let (p, dp) = c.d1(0.5 * (edge.range.0 + edge.range.1));
let (n, m) = (outward(f, p), outward(g, p));
if n.cross(m).norm() <= 1e-7 {
continue;
}
let t = if b.coedge(cf).reversed { -dp } else { dp };
if m.dot(n.cross(t)) < 0.0 {
out.push(e);
}
}
Ok(out)
}
pub fn edges_named(body: &Brep, pair: &EdgeName) -> Result<Vec<EdgeId>> {
blend::picked_edges(body, pair)
}