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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
#[macro_use]
extern crate cpp;
#[cfg(not(feature = "docs-rs"))]
cpp! {{
#include <iterator>
#include <CGAL/Epick_d.h>
#include <CGAL/Triangulation.h>
using DynDimension = CGAL::Dynamic_dimension_tag;
using K = CGAL::Epick_d<DynDimension>;
using Vertex = CGAL::Triangulation_vertex<K, size_t>;
using FullCell = CGAL::Triangulation_full_cell<K, size_t>;
using TDS = CGAL::Triangulation_data_structure<DynDimension, Vertex, FullCell>;
using Triangulation = CGAL::Triangulation<K, TDS>;
}}
#[cfg(not(feature = "docs-rs"))]
cpp! {{
using Point = Triangulation::Point;
using Facet_iterator = Triangulation::Facet_iterator;
using Facet = Triangulation::Facet;
using Full_cell_handle = Triangulation::Full_cell_handle;
using Vertex_handle = Triangulation::Vertex_handle;
using Full_cells = std::vector<Full_cell_handle>;
}}
use std::fmt;
mod cell;
mod vertex;
pub use cell::*;
pub use vertex::*;
#[non_exhaustive]
#[derive(Debug, PartialEq, Eq)]
pub enum TriangulationError {
WrongDimension {
actual_dim: usize,
expected_dim: usize,
},
}
impl fmt::Display for TriangulationError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
use TriangulationError::*;
match self {
WrongDimension {
actual_dim,
expected_dim,
} => write!(
f,
"The vertex could not be added because its dimension was {} instead of {} ",
actual_dim, expected_dim
),
}
}
}
impl std::error::Error for TriangulationError {}
#[derive(Debug, PartialEq, Eq)]
pub struct Triangulation {
ptr: *mut u8,
dim: usize,
next_vertex_id: usize,
next_cell_id: usize,
}
impl Triangulation {
pub fn new(dim: usize) -> Triangulation {
let ptr = unsafe { Self::init_triangulation_ptr(dim) };
Triangulation {
ptr,
dim,
next_vertex_id: 0,
next_cell_id: 1,
}
}
unsafe fn init_triangulation_ptr(dim: usize) -> *mut u8 {
#[cfg(not(feature = "docs-rs"))]
return cpp!([dim as "size_t"] -> *mut u8 as "Triangulation*"{
return new Triangulation(dim);
});
#[cfg(feature = "docs-rs")]
std::ptr::null_mut()
}
pub fn add_vertex(&mut self, coords: &[f64]) -> Result<usize, TriangulationError> {
if coords.len() != self.dim {
return Err(TriangulationError::WrongDimension {
actual_dim: coords.len(),
expected_dim: self.dim,
});
}
let id = unsafe { self.add_vertex_unchecked(coords) };
Ok(id)
}
pub unsafe fn add_vertex_unchecked(&mut self, coords: &[f64]) -> usize {
let tri = self.ptr;
let dim = self.dim;
let coords = coords.as_ptr();
let vertex_id = self.next_vertex_id;
#[cfg(not(feature = "docs-rs"))]
cpp!([tri as "Triangulation*", dim as "size_t", coords as "double*", vertex_id as "size_t"] {
auto p = Point(dim, &coords[0], &coords[dim]);
auto vertex = tri->insert(p);
auto& id = vertex->data();
id = vertex_id;
});
self.next_vertex_id += 1;
vertex_id
}
pub fn convex_hull_cells(&mut self) -> CellIter {
let cells = unsafe { self.gather_ch_cells() };
CellIter::new(self, cells)
}
#[rustfmt::skip]
unsafe fn gather_ch_cells(&mut self) -> *mut u8 {
let tri = self.ptr;
let cell_id = &mut self.next_cell_id;
#[cfg(not(feature = "docs-rs"))]
return cpp!([tri as "Triangulation*", cell_id as "size_t*"] -> *mut u8 as "Full_cells*" {
auto infinite_full_cells = new Full_cells();
std::back_insert_iterator<Full_cells> out(*infinite_full_cells);
tri->incident_full_cells(tri->infinite_vertex(), out);
for (auto& cell: *infinite_full_cells){
auto& id = cell->data();
if(id == 0){
id = *cell_id;
(*cell_id)++;
}
}
return infinite_full_cells;
});
#[cfg(feature = "docs-rs")]
std::ptr::null_mut()
}
pub fn cells(&mut self) -> CellIter {
let cells = unsafe { self.gather_all_cells() };
CellIter::new(self, cells)
}
#[rustfmt::skip]
unsafe fn gather_all_cells(&mut self) -> *mut u8 {
let tri = self.ptr;
let cell_id = &mut self.next_cell_id;
#[cfg(not(feature = "docs-rs"))]
return cpp!([tri as "Triangulation*", cell_id as "size_t*"] -> *mut u8 as "Full_cells*" {
auto full_cells = new Full_cells();
std::back_insert_iterator<Full_cells> out(*full_cells);
for (auto cit = tri->full_cells_begin(); cit != tri->full_cells_end(); ++cit){
auto cell = cit;
auto& id = cell->data();
if(id == 0){
id = *cell_id;
(*cell_id)++;
}
full_cells->push_back(cell);
}
return full_cells;
});
#[cfg(feature = "docs-rs")]
std::ptr::null_mut()
}
}
impl Drop for Triangulation {
fn drop(&mut self) {
let ptr = self.ptr;
unsafe {
#[cfg(not(feature = "docs-rs"))]
cpp!([ptr as "Triangulation*"] {
delete ptr;
})
}
}
}
#[test]
fn test_triangulation_can_be_created_and_dropped_safely() {
let tri = Triangulation::new(3);
assert_eq!(3, tri.dim);
}
#[test]
fn test_vertices_have_to_be_of_right_dimension() {
let mut tri = Triangulation::new(3);
assert!(tri.add_vertex(&[1.0]).is_err());
assert!(tri.add_vertex(&[1.0, 2.0]).is_err());
assert!(tri.add_vertex(&[1.0, 2.0, 3.0]).is_ok());
assert!(tri.add_vertex(&[4.0, 5.0, 6.0]).is_ok());
assert_eq!(
tri.add_vertex(&[1.0, 2.0, 3.0, 4.0]),
Err(TriangulationError::WrongDimension {
actual_dim: 4,
expected_dim: 3
})
);
}
#[test]
fn test_empty_triangulation_has_pseudo_cell() {
let mut tri = Triangulation::new(3);
let ch_cells = tri.convex_hull_cells();
assert_eq!(1, ch_cells.count());
}
#[test]
fn test_convex_hull_has_right_size() {
let mut tri = Triangulation::new(2);
tri.add_vertex(&[1.0, 1.0]).unwrap();
tri.add_vertex(&[2.0, 1.0]).unwrap();
tri.add_vertex(&[1.5, 1.5]).unwrap();
let ch_cells = tri.convex_hull_cells();
assert_eq!(3, ch_cells.count());
}
#[test]
fn test_convex_hull_has_right_cells() {
let mut tri = Triangulation::new(2);
let p1 = &[1.0, 1.0];
let p2 = &[2.0, 1.0];
let p3 = &[1.5, 1.5];
let id1 = tri.add_vertex(p1).unwrap();
let id2 = tri.add_vertex(p2).unwrap();
let id3 = tri.add_vertex(p3).unwrap();
let ch_cells = tri.convex_hull_cells();
for cell in ch_cells {
let mut all_vertices: Vec<_> = cell.vertices().collect();
all_vertices.dedup_by_key(|p| p.id());
assert_eq!(2, all_vertices.len());
let only_input_vertices = all_vertices
.iter()
.map(Vertex::id)
.all(|id| id == id1 || id == id2 || id == id3);
assert!(only_input_vertices);
}
}
#[test]
fn test_triangulation_has_right_size() {
let mut tri = Triangulation::new(2);
tri.add_vertex(&[1.0, 1.0]).unwrap();
tri.add_vertex(&[2.0, 1.0]).unwrap();
tri.add_vertex(&[1.5, 1.5]).unwrap();
let cells = tri.cells();
assert_eq!(4, cells.count());
}