-
-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
5 changed files
with
241 additions
and
73 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -13,4 +13,5 @@ mod mesh; | |
| pub mod plugin; | ||
| mod simplify; | ||
| mod system; | ||
| mod tests; | ||
| pub mod utils; | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,231 @@ | ||
| use inox_math::Vector3; | ||
| use metis::Graph; | ||
|
|
||
| use crate::{adjacency::find_border_vertices, mesh::LocalVertex}; | ||
|
|
||
| #[allow(dead_code)] | ||
| fn simplify_test() { | ||
| // 4----5----6 | ||
| // | | | | ||
| // 1----2----7 | ||
| // | | | | ||
| // 0----3----8 | ||
| #[rustfmt::skip] | ||
| let vertices = [ | ||
| LocalVertex{ pos: Vector3::new(0., 0., 0.), global_index: 0 }, | ||
| LocalVertex{ pos: Vector3::new(0., 1., 0.), global_index: 1 }, | ||
| LocalVertex{ pos: Vector3::new(1., 1., 0.), global_index: 2 }, | ||
| LocalVertex{ pos: Vector3::new(1., 0., 0.), global_index: 3 }, | ||
| LocalVertex{ pos: Vector3::new(0., 2., 0.), global_index: 4 }, | ||
| LocalVertex{ pos: Vector3::new(1., 2., 0.), global_index: 5 }, | ||
| LocalVertex{ pos: Vector3::new(2., 2., 0.), global_index: 6 }, | ||
| LocalVertex{ pos: Vector3::new(2., 1., 0.), global_index: 7 }, | ||
| LocalVertex{ pos: Vector3::new(2., 0., 0.), global_index: 8 }, | ||
| ]; | ||
| #[rustfmt::skip] | ||
| let indices = [ | ||
| 0, 1, 2, | ||
| 2, 3, 0, | ||
| 1, 4, 5, | ||
| 5, 2, 1, | ||
| 2, 5, 6, | ||
| 6, 7, 2, | ||
| 2, 7, 3, | ||
| 3, 7, 8, | ||
| ]; | ||
| let locked_indices = find_border_vertices(&indices); | ||
|
|
||
| debug_assert!( | ||
| !locked_indices.is_empty() && locked_indices.len() < indices.len(), | ||
| "Locked indices are empty or exactly the same of total number of indices" | ||
| ); | ||
|
|
||
| let target_count = 6; | ||
| let target_error = 0.01; | ||
| let simplified_indices = meshopt::simplify_decoder( | ||
| &indices, | ||
| &vertices, | ||
| target_count, | ||
| target_error, | ||
| meshopt::SimplifyOptions::LockBorder, | ||
| None, | ||
| ); | ||
|
|
||
| debug_assert!( | ||
| !simplified_indices.is_empty() && simplified_indices.len() < indices.len(), | ||
| "No simplification happened with meshoptimizer" | ||
| ); | ||
| } | ||
|
|
||
| #[allow(dead_code)] | ||
| fn partition_test() { | ||
| // 0----3----6----9----12 | ||
| // | #0 | #1 | #2 | #3 | | ||
| // 1----4----7----10---13 | ||
| // | #4 | #5 | #6 | #7 | | ||
| // 2----5----8----11---14 | ||
| #[rustfmt::skip] | ||
| let clusters_adiacency = [ | ||
| vec![1, 4], | ||
| vec![0, 2, 5], | ||
| vec![1, 3, 6], | ||
| vec![2, 7], | ||
| vec![0, 5], | ||
| vec![1, 4, 6], | ||
| vec![2, 5, 7], | ||
| vec![3, 6], | ||
| ]; | ||
|
|
||
| let num_meshlets = clusters_adiacency.len(); | ||
| let mut xadj = Vec::new(); | ||
| let mut adjncy = Vec::new(); | ||
| for a in clusters_adiacency { | ||
| let start = adjncy.len() as i32; | ||
| xadj.push(start); | ||
| for v in a { | ||
| adjncy.push(v); | ||
| } | ||
| } | ||
| xadj.push(adjncy.len() as i32); | ||
|
|
||
| let mut groups = Vec::new(); | ||
| let expected = vec![vec![0, 1, 4, 5], vec![2, 3, 6, 7]]; | ||
| let num_groups = expected.len(); | ||
| if let Ok(graph) = Graph::new(1, num_groups as i32, &xadj, &adjncy) { | ||
| let mut part = vec![0; num_meshlets]; | ||
| if let Ok(result) = graph.part_kway(&mut part) { | ||
| for group_index in 0..num_groups as i32 { | ||
| let mut group = Vec::new(); | ||
| part.iter().enumerate().for_each(|(i, &v)| { | ||
| if v == group_index { | ||
| group.push(i); | ||
| } | ||
| }); | ||
| group.sort(); | ||
| groups.push(group); | ||
| } | ||
| groups.sort(); | ||
| println!("Result[{}] = {:?}", result, groups); | ||
| } | ||
| } | ||
| debug_assert!( | ||
| groups == expected, | ||
| "\nExpecting: {:?}\nResult: {:?}", | ||
| expected, | ||
| groups | ||
| ); | ||
| } | ||
|
|
||
| #[allow(dead_code)] | ||
| fn weighted_partition_test() { | ||
| // X----X----X----X----X-----X----X | ||
| // | | | | ||
| // X #0 X----X #1 X | ||
| // | | | | ||
| // X----X----X----X----X-----X----X | ||
| // | | | | ||
| // X #3 X----X #2 X | ||
| // | | | | | ||
| // X----X----X----X X-----X----X | ||
| // | | | | ||
| // X #4 X #5 X | ||
| // | | | | ||
| // X----X----X----X----X-----X----X | ||
| #[rustfmt::skip] | ||
| let clusters_adiacency = [ | ||
| vec![1, 3], | ||
| vec![0, 2, 3], | ||
| vec![1, 3, 5], | ||
| vec![0, 1, 2, 4, 5], | ||
| vec![3, 5], | ||
| vec![2, 3, 4], | ||
| ]; | ||
| #[rustfmt::skip] | ||
| let shared_edges = [ | ||
| vec![0, 3, 0, 3, 0, 0], | ||
| vec![3, 0, 2, 1, 0, 0], | ||
| vec![0, 2, 0, 1, 0, 3], | ||
| vec![3, 1, 1, 0, 3, 2], | ||
| vec![0, 0, 0, 3, 0, 2], | ||
| vec![0, 0, 3, 2, 2, 0], | ||
| ]; | ||
|
|
||
| let num_meshlets = clusters_adiacency.len(); | ||
| let mut xadj = Vec::new(); | ||
| let mut adjncy = Vec::new(); | ||
| let mut adjwgt = Vec::new(); | ||
| clusters_adiacency | ||
| .iter() | ||
| .enumerate() | ||
| .for_each(|(cluster_index, a)| { | ||
| let start = adjncy.len() as i32; | ||
| xadj.push(start); | ||
| for v in a { | ||
| adjncy.push(*v); | ||
| adjwgt.push(shared_edges[cluster_index][*v as usize]); | ||
| } | ||
| }); | ||
| xadj.push(adjncy.len() as i32); | ||
|
|
||
| let num_groups = 3; | ||
|
|
||
| let mut groups = Vec::new(); | ||
| let expected_without_weights = vec![vec![0, 1], vec![2, 3], vec![4, 5]]; | ||
| let expected_with_weights = vec![vec![0, 1], vec![2, 5], vec![3, 4]]; | ||
|
|
||
| if let Ok(graph) = Graph::new(1, num_groups, &xadj, &adjncy) { | ||
| let mut part = vec![0; num_meshlets]; | ||
| if let Ok(result) = graph.part_kway(&mut part) { | ||
| for group_index in 0..num_groups { | ||
| let mut group = Vec::new(); | ||
| part.iter().enumerate().for_each(|(i, &v)| { | ||
| if v == group_index { | ||
| group.push(i); | ||
| } | ||
| }); | ||
| group.sort(); | ||
| groups.push(group); | ||
| } | ||
| groups.sort(); | ||
| println!("Result[{}] = {:?}", result, groups); | ||
| } | ||
| } | ||
| debug_assert!( | ||
| groups == expected_without_weights, | ||
| "\nExpecting: {:?}\nResult: {:?}", | ||
| expected_without_weights, | ||
| expected_without_weights | ||
| ); | ||
| groups.clear(); | ||
|
|
||
| if let Ok(graph) = Graph::new(1, num_groups, &xadj, &adjncy) { | ||
| let mut part = vec![0; num_meshlets]; | ||
| if let Ok(result) = graph.set_adjwgt(&adjwgt).part_kway(&mut part) { | ||
| for group_index in 0..num_groups { | ||
| let mut group = Vec::new(); | ||
| part.iter().enumerate().for_each(|(i, &v)| { | ||
| if v == group_index { | ||
| group.push(i); | ||
| } | ||
| }); | ||
| group.sort(); | ||
| groups.push(group); | ||
| } | ||
| groups.sort(); | ||
| println!("Result[{}] = {:?}", result, groups); | ||
| } | ||
| } | ||
| debug_assert!( | ||
| groups == expected_with_weights, | ||
| "\nExpecting: {:?}\nResult: {:?}", | ||
| expected_with_weights, | ||
| expected_with_weights | ||
| ); | ||
| } | ||
|
|
||
| #[test] | ||
| fn tests() { | ||
| simplify_test(); | ||
| partition_test(); | ||
| weighted_partition_test(); | ||
| } |