use super::kinetic::{ccw, cw, KineticTriangulation, Side, TriangleId};
pub fn step_around(
kt: &KineticTriangulation,
tid: TriangleId,
v_idx: Side,
use_cw: bool,
) -> Option<(TriangleId, Side)> {
let t = kt.triangles.get(tid)?;
if kt.infinite_vertex.is_some() && t.vertices[v_idx] == kt.infinite_vertex {
return None;
}
let next = if use_cw {
t.neighbors[cw(v_idx)]
} else {
t.neighbors[ccw(v_idx)]
}?;
let t_in_n = kt.neighbor_side(next, tid)?;
let v_in_n = if use_cw { cw(t_in_n) } else { ccw(t_in_n) };
Some((next, v_in_n))
}
pub fn most_around(
kt: &KineticTriangulation,
tid: TriangleId,
v_idx: Side,
use_cw: bool,
) -> (TriangleId, Side) {
let mut cur = (tid, v_idx);
let mut guard = 0;
loop {
guard += 1;
if guard > 10_000 {
return cur;
}
match step_around(kt, cur.0, cur.1, use_cw) {
Some(n) => {
if n.0 == tid {
return cur;
}
cur = n;
}
None => return cur,
}
}
}