|
1 | | -# import compas |
2 | | -# from compas_libigl.mapping import map_mesh |
3 | | -# from compas.datastructures import Mesh |
4 | | - |
5 | | - |
6 | | -# def test_map_mesh(): |
7 | | -# # Create target mesh (using a mesh we know exists) |
8 | | -# mesh = Mesh.from_off(compas.get("tubemesh.off")) |
9 | | -# mesh.quads_to_triangles() # Ensure we have a triangle mesh |
10 | | -# v, f = mesh.to_vertices_and_faces() |
11 | | - |
12 | | -# # Create simple pattern mesh manually (grid pattern) |
13 | | -# # Use a smaller UV range to ensure pattern falls within target's parameterization |
14 | | -# u_num, v_num = 5, 5 |
15 | | -# # Use a smaller central region of the UV space |
16 | | -# u_range = [0.2, 0.8] # Avoid edges of UV space |
17 | | -# v_range = [0.2, 0.8] # Avoid edges of UV space |
18 | | - |
19 | | -# # Generate grid vertices |
20 | | -# pv = [] |
21 | | -# for j in range(v_num + 1): |
22 | | -# v_param = v_range[0] + j * (v_range[1] - v_range[0]) / v_num |
23 | | -# for i in range(u_num + 1): |
24 | | -# u_param = u_range[0] + i * (u_range[1] - u_range[0]) / u_num |
25 | | -# pv.append([u_param, v_param, 0]) |
26 | | - |
27 | | -# # Create faces (triangulated quads) |
28 | | -# pf = [] |
29 | | -# for j in range(v_num): |
30 | | -# for i in range(u_num): |
31 | | -# # Calculate vertex indices for this quad |
32 | | -# v0 = j * (u_num + 1) + i |
33 | | -# v1 = j * (u_num + 1) + i + 1 |
34 | | -# v2 = (j + 1) * (u_num + 1) + i + 1 |
35 | | -# v3 = (j + 1) * (u_num + 1) + i |
36 | | - |
37 | | -# # Split quad into two triangles |
38 | | -# pf.append([v0, v1, v2]) |
39 | | -# pf.append([v0, v2, v3]) |
40 | | - |
41 | | -# # Map pattern onto target mesh |
42 | | -# mv, mf, mn, mb, mg = map_mesh((v, f), (pv, pf)) |
43 | | -# mesh_mapped = Mesh.from_vertices_and_faces(mv, mf) |
44 | | - |
45 | | -# # Verify the result is a valid mesh |
46 | | -# assert mesh_mapped is not None |
47 | | -# assert mesh_mapped.number_of_vertices() > 0 |
48 | | -# assert mesh_mapped.number_of_faces() > 0 |
49 | | -# assert isinstance(mesh_mapped, Mesh) |
50 | | - |
51 | | -# # Check that at least some faces were mapped |
52 | | -# assert mesh_mapped.number_of_faces() > 0 |
| 1 | +import compas |
| 2 | +from compas_libigl.mapping import map_mesh |
| 3 | +from compas.datastructures import Mesh |
| 4 | + |
| 5 | + |
| 6 | +def test_map_mesh(): |
| 7 | + # Create target mesh (using a mesh we know exists) |
| 8 | + mesh = Mesh.from_off(compas.get("tubemesh.off")) |
| 9 | + mesh.quads_to_triangles() # Ensure we have a triangle mesh |
| 10 | + v, f = mesh.to_vertices_and_faces() |
| 11 | + |
| 12 | + # Create simple pattern mesh manually (grid pattern) |
| 13 | + # Use a smaller UV range to ensure pattern falls within target's parameterization |
| 14 | + u_num, v_num = 5, 5 |
| 15 | + # Use a smaller central region of the UV space |
| 16 | + u_range = [0.2, 0.8] # Avoid edges of UV space |
| 17 | + v_range = [0.2, 0.8] # Avoid edges of UV space |
| 18 | + |
| 19 | + # Generate grid vertices |
| 20 | + pv = [] |
| 21 | + for j in range(v_num + 1): |
| 22 | + v_param = v_range[0] + j * (v_range[1] - v_range[0]) / v_num |
| 23 | + for i in range(u_num + 1): |
| 24 | + u_param = u_range[0] + i * (u_range[1] - u_range[0]) / u_num |
| 25 | + pv.append([u_param, v_param, 0]) |
| 26 | + |
| 27 | + # Create faces (triangulated quads) |
| 28 | + pf = [] |
| 29 | + for j in range(v_num): |
| 30 | + for i in range(u_num): |
| 31 | + # Calculate vertex indices for this quad |
| 32 | + v0 = j * (u_num + 1) + i |
| 33 | + v1 = j * (u_num + 1) + i + 1 |
| 34 | + v2 = (j + 1) * (u_num + 1) + i + 1 |
| 35 | + v3 = (j + 1) * (u_num + 1) + i |
| 36 | + |
| 37 | + # Split quad into two triangles |
| 38 | + pf.append([v0, v1, v2]) |
| 39 | + pf.append([v0, v2, v3]) |
| 40 | + |
| 41 | + # Map pattern onto target mesh |
| 42 | + mv, mf, mn, mb, mg = map_mesh((v, f), (pv, pf)) |
| 43 | + mesh_mapped = Mesh.from_vertices_and_faces(mv, mf) |
| 44 | + |
| 45 | + # Verify the result is a valid mesh |
| 46 | + assert mesh_mapped is not None |
| 47 | + assert mesh_mapped.number_of_vertices() > 0 |
| 48 | + assert mesh_mapped.number_of_faces() > 0 |
| 49 | + assert isinstance(mesh_mapped, Mesh) |
| 50 | + |
| 51 | + # Check that at least some faces were mapped |
| 52 | + assert mesh_mapped.number_of_faces() > 0 |
0 commit comments