1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
use crate::*;
#[test]
fn mev_cycle() {
Dcel::<u32>::new(|mut dcel| {
let body = dcel.new_body();
let op = dcel.mevvlfs(*body, [0, 1]).unwrap();
let op2 = dcel.mev(*op.shell, *op.loop_, *op.vertices[1], 2);
let op3 = dcel.mev(*op.shell, *op.loop_, *op2.new_vertex, 3);
dcel.melf(*op.shell, [*op3.new_vertex, *op.vertices[0]], *op.loop_);
let mut vertices = op
.loop_
.iter_half_edges(&dcel)
.map(|x| *x.origin().data())
.peekable();
assert!((0..4)
.cycle()
.skip(*vertices.peek().unwrap() as _)
.take(4)
.eq(vertices));
})
}
#[test]
fn kemh_mekh() {
#[derive(Copy, Clone, Debug, Eq, PartialEq)]
enum Vert {
Inner(u8),
Outer(u8),
}
use Vert::*;
impl Vert {
fn flip(self) -> Self {
match self {
Outer(x) => Inner(x),
Inner(x) => Outer(x),
}
}
fn is_outer(self) -> bool {
match self {
Outer(_) => true,
Inner(_) => false,
}
}
fn either(self) -> u8 {
match self {
Outer(x) => x,
Inner(x) => x,
}
}
}
Dcel::<Vert>::new(|mut dcel| {
let body = dcel.new_body();
let Kevvlfs {
shell,
loop_: loop_0,
vertices: [inner_0, inner_1],
..
} = dcel.mevvlfs(*body, [Inner(0), Inner(1)]).unwrap();
let inner_2 = dcel.mev(*shell, *loop_0, *inner_1, Inner(2)).new_vertex;
let mut outer_loop = dcel.melf(*shell, [*inner_0, *inner_2], *loop_0).new_loop;
let Mev {
new_vertex: outer_0,
edge,
..
} = dcel.mev(*shell, *outer_loop, *inner_0, Outer(0));
let outer_1 = dcel.mev(*shell, *outer_loop, *outer_0, Outer(1)).new_vertex;
let outer_2 = dcel.mev(*shell, *outer_loop, *outer_1, Outer(2)).new_vertex;
let loop_2 = dcel
.melf(*shell, [*outer_0, *outer_2], *outer_loop)
.new_loop;
if edge.lens(&dcel).half_edges()[0].loop_().eq(*loop_2) {
outer_loop = loop_2;
}
let mut kemh = Kemh::new(*shell, edge, *outer_loop, *inner_0);
for i in 0..10 {
struct State {
seen: u8,
last: Option<Vert>,
}
let mut st = State {
seen: 0,
last: None,
};
for v in outer_loop
.iter_half_edges(&dcel)
.map(|x| *x.origin().data())
{
let mut s = 1u8 << v.either();
if v.is_outer() {
s <<= 4;
}
if st.seen & s == 0 {
st.seen |= s;
} else {
assert_eq!(v.either(), 0);
assert_eq!(st.seen & (s << 3), 0);
st.seen |= s << 3;
}
if let Some(last) = st.last {
if v.either() == 0 {
assert!(
last == v.flip()
|| (last.is_outer() == v.is_outer() && last.either() != 0)
);
} else {
assert_eq!(last.is_outer(), v.is_outer());
}
}
st.last = Some(v);
}
assert_eq!(st.seen, 255);
let mekh = kemh.apply(&mut dcel).unwrap();
for (loop_, outer) in [(*outer_loop, true), (*mekh.hole_loop, false)] {
let mut seen = 0;
for v in loop_.iter_half_edges(&dcel).map(|x| *x.origin().data()) {
let s = 1 << v.either();
assert_eq!(v.is_outer(), outer);
assert_eq!(seen & s, 0);
seen |= s;
}
assert_eq!(seen, 7);
}
kemh = mekh.apply(&mut dcel).unwrap();
}
})
}
|
