feat: surface stuff

bampy/src/lib.rs

@@ -23,12 +23,25 @@ pub struct SliceOptions {
     max_angle: f32,
 }
 
+#[derive(Tsify, Serialize, Deserialize)]
+#[serde(rename_all = "camelCase", tag = "type")]
+#[tsify(into_wasm_abi)]
+pub enum Slice {
+    Surface {
+        #[tsify(type = "Float32Array")]
+        position: Vec<f32>,
+    },
+    Ring {
+        #[tsify(type = "Float32Array")]
+        position: Vec<f32>,
+    },
+}
+
 #[derive(Tsify, Serialize, Deserialize)]
 #[serde(rename_all = "camelCase")]
 #[tsify(into_wasm_abi)]
 pub struct SliceResult {
-    #[tsify(type = "Array<Float32Array>")]
-    rings: Vec<Vec<f32>>,
+    slices: Vec<Slice>,
 }
 
 #[wasm_bindgen]
@@ -68,7 +81,7 @@ pub fn slice(
             slicable_triangles.push(triangle);
         } else {
             slicable_triangles.push(triangle);
-            //surface_triangles.push(triangle);
+            surface_triangles.push(triangle);
         }
     }
     slicable_triangles.shrink_to_fit();
@@ -79,7 +92,7 @@ pub fn slice(
     };
 
     console_log!("Creating Surfaces");
-    // let surfaces = split_surface(surface_triangles);
+    let surfaces = split_surface(surface_triangles);
 
     console_log!("Computing BVH");
     let slicable = Mesh::from(slicable_triangles);
@@ -88,15 +101,36 @@ pub fn slice(
     console_log!("Done");
 
     SliceResult {
-        rings: slices
+        slices: slices
             .into_iter()
-            .map(|slice| {
-                slice
+            .map(|slice| Slice::Ring {
+                position: slice
                     .points
                     .into_iter()
                     .flat_map(|point| [point.x as f32, point.y as f32, point.z as f32])
-                    .collect()
+                    .collect(),
             })
+            .chain(surfaces.into_iter().map(|surface| {
+                Slice::Surface {
+                    position: surface
+                        .triangles
+                        .into_iter()
+                        .flat_map(|triangle| {
+                            [
+                                triangle.a.x as f32,
+                                triangle.a.y as f32,
+                                triangle.a.z as f32,
+                                triangle.b.x as f32,
+                                triangle.b.y as f32,
+                                triangle.b.z as f32,
+                                triangle.c.x as f32,
+                                triangle.c.y as f32,
+                                triangle.c.z as f32,
+                            ]
+                        })
+                        .collect(),
+                }
+            }))
             .collect(),
     }
 }

bampy/src/slicer/split_surface.rs

@@ -2,7 +2,7 @@ use super::{mesh::Mesh, triangle::Triangle};
 use bvh::bvh::{Bvh, BvhNode};
 
 /// Splits a surface into connected surfaces.
-pub fn split_surface(mut triangles: Vec<Triangle<f32>>) -> Vec<Mesh<f32>> {
+pub fn split_surface(mut triangles: Vec<Triangle<f64>>) -> Vec<Mesh<f64>> {
     let mut surfaces = vec![];
     while let Some(triangle) = triangles.pop() {
         let mut surface = vec![triangle];
@@ -20,10 +20,10 @@ pub fn split_surface(mut triangles: Vec<Triangle<f32>>) -> Vec<Mesh<f32>> {
                         child_r_index,
                         child_r_aabb,
                     } => {
-                        if triangle.intersects_aabb(&child_l_aabb) {
+                        if triangle.has_point_in_aabb(&child_l_aabb) {
                             stack.push(child_l_index);
                         }
-                        if triangle.intersects_aabb(&child_r_aabb) {
+                        if triangle.has_point_in_aabb(&child_r_aabb) {
                             stack.push(child_r_index);
                         }
                     }

bampy/src/slicer/triangle.rs

@@ -1,4 +1,4 @@
-use approx::{relative_eq, relative_ne, AbsDiffEq, RelativeEq};
+use approx::{relative_eq, AbsDiffEq, RelativeEq};
 use bvh::{
     aabb::{Aabb, Bounded},
     bounding_hierarchy::BHShape,
@@ -64,7 +64,7 @@ where
         }
     }
 
-    pub fn intersects_aabb(&self, aabb: &Aabb<T, 3>) -> bool {
+    pub fn has_point_in_aabb(&self, aabb: &Aabb<T, 3>) -> bool {
         vec_inside_aabb(&self.a, aabb)
             || vec_inside_aabb(&self.b, aabb)
             || vec_inside_aabb(&self.c, aabb)