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

//! A marching cubes implementation in Rust
//!
//! This library provides a fast and efficient implementation of the marching cubes algorithm in Rust.
//! The algorithm is used to extract isosurfaces from 3D volumetric data and is commonly used in fields such as computer graphics, medical imaging, and scientific visualization.
//!
//! # Examples
//!
//! ```
//! use iso::{MarchingCubes, GridCell, Triangle};
//!
//! let grid = GridCell {
//!     positions: [
//!         [0.0, 0.0, 0.0],
//!         [1.0, 0.0, 0.0],
//!         [1.0, 1.0, 0.0],
//!         [0.0, 1.0, 0.0],
//!         [0.0, 0.0, 1.0],
//!         [1.0, 0.0, 1.0],
//!         [1.0, 1.0, 1.0],
//!         [0.0, 1.0, 1.0]
//!     ],
//!     value: [0.0, 0.5, 0.5, 1.0, 0.0, 1.0, 1.0, 0.0],
//! };
//! let mut triangles = vec![];
//! 
//! let isolevel = 0.5;
//! let mc = MarchingCubes::new(isolevel, grid); 
//! let triangle_count = mc.polygonise(&mut triangles);
//!
//! assert_eq!(triangle_count, 4);
//!
//! The `MarchingCubes` struct is the main entry point to the library.
//! The `new` method creates a new instance of the algorithm and takes two arguments: the 3D volumetric data as a nested array of scalar values and the isovalue used to extract the isosurface.
//! The `polygonise` method executes the algorithm and returns the resulting vertices as a vector of 3D points.
//!
//! Note that the example code uses a 4x4x4 volume for simplicity, but in practice the volume size can be much larger and the algorithm will scale accordingly.

pub mod container;
pub mod marching;
pub mod tables;