-
-
Notifications
You must be signed in to change notification settings - Fork 119
/
face.rs
78 lines (64 loc) · 2.25 KB
/
face.rs
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
use fj_interop::ext::ArrayExt;
use fj_math::Point;
use crate::{
objects::{Cycle, Face, HalfEdge, Region, Surface, Vertex},
operations::{
BuildCycle, BuildHalfEdge, BuildSurface, Insert, IsInserted,
IsInsertedNo,
},
services::Services,
storage::Handle,
};
/// Build a [`Face`]
pub trait BuildFace {
/// Build a face with an empty exterior, no interiors, and no color
fn unbound(surface: Handle<Surface>, services: &mut Services) -> Face {
let exterior = Cycle::empty().insert(services);
let region = Region::new(exterior, [], None).insert(services);
Face::new(surface, region)
}
/// Build a triangle
fn triangle(
points: [impl Into<Point<3>>; 3],
services: &mut Services,
) -> Polygon<3> {
let [a, b, c] = points.map(Into::into);
let surface = Surface::plane_from_points([a, b, c]).insert(services);
let (exterior, edges, vertices) = {
let half_edges = [[a, b], [b, c], [c, a]].map(|points| {
let half_edge = HalfEdge::line_segment_from_global_points(
points, &surface, None, services,
);
half_edge.insert(services)
});
let vertices = half_edges
.each_ref_ext()
.map(|half_edge| half_edge.start_vertex().clone());
let cycle = Cycle::new(half_edges.clone()).insert(services);
(cycle, half_edges, vertices)
};
let region = Region::new(exterior, [], None).insert(services);
let face = Face::new(surface, region);
Polygon {
face,
edges,
vertices,
}
}
}
impl BuildFace for Face {}
/// A polygon
///
/// # Implementation Note
///
/// Currently code that deals with `Polygon` might assume that the polygon has
/// no holes. Unless you create a `Polygon` yourself, or modify a `Polygon`'s
/// `face` field to have interior cycles, this should not affect you.
pub struct Polygon<const D: usize, I: IsInserted = IsInsertedNo> {
/// The face that forms the polygon
pub face: I::T<Face>,
/// The edges of the polygon
pub edges: [Handle<HalfEdge>; D],
/// The vertices of the polygon
pub vertices: [Handle<Vertex>; D],
}