mesh-graph 0.6.0

Fast halfedge triangle mesh graph in pure Rust
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

use std::path::Path;

use anyhow::{Context, Result, anyhow};
use itertools::Itertools;

use crate::MeshGraph;

pub fn load(file: impl AsRef<Path>) -> Result<MeshGraph> {
    let (document, buffers, _) = gltf::import(&file).context("Failed to load GLTF file")?;

    let mesh = document
        .meshes()
        .next()
        .ok_or(anyhow!("Document has no meshes"))?;
    let primitive = mesh
        .primitives()
        .next()
        .ok_or(anyhow!("Mesh has no primitives"))?;
    let reader = primitive.reader(|buffer| Some(&buffers[buffer.index()]));
    let pos_iter = reader
        .read_positions()
        .ok_or(anyhow!("Failed to read positions"))?;
    let indices = reader
        .read_indices()
        .ok_or(anyhow!("Failed to read indices"))?
        .into_u32()
        .map(|i| i as usize)
        .collect::<Vec<_>>();

    Ok(MeshGraph::indexed_triangles(
        &pos_iter.map(|p| p.into()).collect_vec(),
        &indices,
    ))
}