Отчет по учебной

• Название: Отчет по учебной
• Дата: 06.12.2022
• Размер: 415.93 Kb.
• Имя файла: Kursovaya_rabota_v_1_8.docx
• Тип: Отчет; #830166
• страница: 11 из 12

19

20. 
    for i in range ( len ( points )):
    
21. 
    edge = []
    

22

23. 
    if i == len ( points ) - 1:
    
24. 
    edge . append ( i)
    
25. 
    edge . append (0)
    
26. 
    else :
    
27. 
    edge . append ( i)
    
28. 
    edge . append ( i + 1)
    

29

30 edges . append ( tuple ( edge ))

31

32 return {’ verts ’ : points , ’ edges ’ : edges }
Листинг А.3 – Создание сетки и объекта.

1. 
   def create_mesh_obj ( name , data ):
   
2. 
   m = bpy . data . meshes . new ( name + ’ _mesh ’)
   
3. 
   o = bpy . data . objects . new ( name , m)
   

4

5 o. location = (0 , 0 , 0)

6

7 bpy . context . scene . objects . link ( o)

8

9 m. from_pydata ( data [’ verts ’], data [’ edges ’], [])

10

11 m. update ( calc_edges = True )

12

13 return o
Листинг А.4 – Создание матрицы вращения.

1 def create_snowflake (o, iterations = 2):

2

3. 
   rot_matrix = Matrix . Rotation ( radians (90) , 3 , ’Z ’)
   
4. 
   turn_around_matrix = Matrix . Rotation ( radians (180) , 3 , ’Z ’)
   

5

6. 
   o. select = True
   
7. 
   bpy . context . scene . objects . active = o
   

8

9. 
   if o. mode != ’ EDIT ’: bpy . ops . object . mode_set ( mode = ’ EDIT ’)
   
10. 
    bpy . ops . mesh . select_mode ( type = ’ VERT ’)
    

11

12	for	i in range ( iterations ):
13		d = o. data
14		bm = bmesh . from_edit_mesh ( d)
15		bv = bm. verts
16		edges = { e. index : [ v. index for v in e. verts ]		for	e		in	bm
17	.		edges }
18	for		edge_index , edge in enumerate ( edges ):
19			bpy . ops . mesh . select_mode ( type = ’ VERT ’)
20
21			bpy . ops . mesh . select_all ( action = ’ DESELECT ’)
22
23			bm. verts . ensure_lookup_table ()
24
25			for v in edges [ edge ]:
26			bv[ v]. select = True
27
28			bm. select_flush ( True )
29
30			result = bpy . ops . mesh . subdivide ( number_cuts =			2)
31
32			bm. select_flush ( True )
33
34			selected_edges = {
35			e. index : set ([ v. index for v in e. verts ])			\
36			for e in bm. edges if e. select
37			}
38

39. 
    mid = 42
    
40. 
    for i in selected_edges . keys ():
    
41. 
    other_edges = set ( selected_edges . keys ()) - set ([ i
    

])

42

43. 
    num_of_joint_verts = 0
    
44. 
    for oe in other_edges :
    
45. 
    if selected_edges [ i] & selected_edges [ oe ]:
    
46. 
    num_of_joint_verts += 1
    

47

48. 
    if num_of_joint_verts == 2:
    
49. 
    mid = i
    
50. 
    break
    

51

52 bm. verts . ensure_lookup_table ()

53

54. 
    bpy . ops . mesh . select_all ( action = ’ DESELECT ’)
    
55. 
    for v in selected_edges [ mid ]:
    
56. 
    bv[ v]. select = True
    

57

58 bm. select_flush ( True )

59

60 bpy . ops . mesh . subdivide ( number_cuts = 1)

61

62. 
    selected_edges_verts = [
    
63. 
    set ([ v. index for v in e. verts ]) for e in bm. edges if e. select
    

64 ]

65

66. 
    joint_vert = list (
    
67. 
    selected_edges_verts [0] & selected_edges_verts