hem. Now I need to search through the original points that comprise the voronoi diagram and replace them with the new averaged points. I need to do this while still preserving the logic of the old data tree which is comprised of {i}j values. In other words each point is grouped into a vornoi cell so that the cells can be created with the polyline component
I believe I have a relatively simple solution, but need help create a python script that searches and replaces values within a data tree.See the psuedo code below:
Psuedo-Code:
For each item(i) in Data tree B (list of index values points to be replaced grouped into a data tree corresponding to the new point) find the corresponding integer in Data tree C (list of points grouped around {i;j} values)Then replace the integer in Data Tree C with the key value (the data tree path) that corresponds to the item from Data tree B that is replacing the item from Data tree CFor example:Data Tree B{14}(0)2(1)3(2)6(3)11(4)13(5)14Data Tree C{0;1}(0)2(1)3(2)6Output:Data Tree {0;1}(0){14}(1){14}(2){14}
List A - Single point (New Point) with Data Tree/Key value corresponding to group of points it will replace ( List B)
List B-list of index values of flattened voronoi point list with Data Tree/Key Value corresponding to List A - in other words these are all the points I need to replace with the point in List A
List C-list of index values of flattened voronoi point list with Data Tree/Key Value corresponding to {i}j values necessary to re-create voronoi cells with the polyline component
Once this is done I can use the Output and the new Points in List A to replace the set of old points in the original voronoi diagram with the new set up reduced points.
If there is another way to achieve the goal of eliminating small edges of a vorononi diagram, I'm open to suggestions.
…
9 8 7 6
5 4 3 2 1 0
I am triangulating this surface. I want to select just the red vertices. As you can note, I just need the inner vertices of this surface. I could do it mannually, but if I want to change the mesh density later, I will have to pick all of them manually again later.
Can someone help me?
Tks
…
the catenary shape
6) Get the mid point of all the heaxgons
7) Create surfaces to get the average normal of each hexagons
8) Project the hexagon on the normal plane
9) Move the plane using the normals
10) create mesh faces between first and second hexagons
11) create mesh faces to close the planar hexagon
12) Orient all the mesh faces on a flat grid to laser cut them
13) Join and weld the mesh
14) Thicken the mesh using Weaverbird to get a shell
I hope this helps. It is all one mesh at the end made of quads on the side and triangles on the top (yes 6 of them).
All the best,
Arthur
…
fault materials...6 RAD materials are loaded1. 2. Downloading OpenStudioMasterTemplate.idf to c:\ladybug\3. Loading EP construction library4. 206 material found in c:\ladybug\OpenStudioMasterTemplate.idf5. 30 windowmaterial found in c:\ladybug\OpenStudioMasterTemplate.idf6. 284 construction found in c:\ladybug\OpenStudioMasterTemplate.idf7. Loading EP schedules...8. The ScheduleTypeLimits: Fraction is already existed in the libaray.You need to rename this ScheduleTypeLimits.9. The ScheduleTypeLimits: Temperature 7 is already existed in the libaray.You need to rename this ScheduleTypeLimits.10. 21 scheduletypelimits found in c:\ladybug\OpenStudioMasterTemplate.idf11. 1370 schedule found in c:\ladybug\OpenStudioMasterTemplate.idf12. 13. 14. Hooohooho...Flying!!Vviiiiiiizzz...…
e
7. True
8. True <-- this one
9. True
10. False
11. True
12. False
13. True
14. True <-- this one
15. True
16. False
17. True
18. False
19. True
20. True <-- this one
21. True
22. False
23. True
24. False
25. True
26. True <-- this one
27. True
28. False
29. True
30. False
31. True
32. True <-- this one
33. True
Any idea how I can solve this?
Thanks!…