solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
Documentation 
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

//! Mesh processing trait definitions.
use crate::DType;

use numr::error::Result;
use numr::runtime::Runtime;
use numr::tensor::Tensor;

/// A triangle mesh.
#[derive(Debug, Clone)]
pub struct Mesh<R: Runtime<DType = DType>> {
    /// Vertex positions, shape [n_vertices, n_dims].
    pub vertices: Tensor<R>,
    /// Triangle indices, shape [n_triangles, 3] (I64 dtype).
    pub triangles: Tensor<R>,
    /// Optional per-vertex normals, shape [n_vertices, n_dims].
    pub normals: Option<Tensor<R>>,
}

/// Mesh simplification method.
#[derive(Debug, Clone, Copy)]
pub enum SimplificationMethod {
    /// Quadric Error Metrics (Garland & Heckbert).
    QuadricError,
}

/// Mesh smoothing method.
#[derive(Debug, Clone, Copy)]
pub enum SmoothingMethod {
    /// Simple Laplacian smoothing.
    Laplacian {
        /// Smoothing factor in (0, 1).
        lambda: f64,
    },
    /// Taubin smoothing (shrink-free).
    Taubin {
        /// Smoothing factor (positive).
        lambda: f64,
        /// Inflation factor (negative, |mu| > lambda).
        mu: f64,
    },
}

/// Mesh processing algorithms.
pub trait MeshAlgorithms<R: Runtime<DType = DType>> {
    /// Triangulate a simple polygon (ear clipping algorithm).
    ///
    /// # Arguments
    /// * `vertices` - Ordered polygon vertices, shape [n_vertices, 2] or [n_vertices, 3]
    ///
    /// # Returns
    /// A Mesh with the input vertices and computed triangle indices.
    fn triangulate_polygon(&self, vertices: &Tensor<R>) -> Result<Mesh<R>>;

    /// Simplify a mesh by reducing the number of faces.
    ///
    /// # Arguments
    /// * `mesh` - Input triangle mesh
    /// * `target_faces` - Target number of faces after simplification
    /// * `method` - Simplification algorithm to use
    fn mesh_simplify(
        &self,
        mesh: &Mesh<R>,
        target_faces: usize,
        method: SimplificationMethod,
    ) -> Result<Mesh<R>>;

    /// Smooth a mesh by iteratively adjusting vertex positions.
    ///
    /// # Arguments
    /// * `mesh` - Input triangle mesh
    /// * `iterations` - Number of smoothing iterations
    /// * `method` - Smoothing algorithm to use
    fn mesh_smooth(
        &self,
        mesh: &Mesh<R>,
        iterations: usize,
        method: SmoothingMethod,
    ) -> Result<Mesh<R>>;
}