SMath Studio Forum
»
SMath Studio
»
Questions
»
Split Areas(Polygons convex and concave) by lines
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
Hi everyone ,I'm doing a momentum curvature usign Popovic's Method and found a big problem beacuse to divide a polygon(convex and concave) into small fiber like this image but with more lines: it's not so easy to do an algorithm. I did a smath file when the polygon it's rectangular but for more general case my smath code doesn't work, I'd like know an algorithm, code or function if it's posible in smath or other language to develop. Best regards. Jesus. Verificacion_de_fluencia_en_acero_fiber_method_degradation_forum.pdf (551kb) downloaded 30 time(s).Edited by user 29 July 2022 19:31:21(UTC)
| Reason: Not specified
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
If I understand ... Your polygon has 9 vertices, we can try a circular spline. That will add as many points between vertices, is it ? From there: Area, Perimeter, Center of Gravity. Give the vertices... Jean.
|
|
|
|
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
Hi Jean, exactly I need to known the area, center of gravity and perimeter of the division but the polygon doesn't need to have 9 vertices, this is an example in this case. In general ,I'd like to calculate for n vertices polygon(convex or concave),let me give an example in smath for regular polygon. polygon_2.sm (37kb) downloaded 12 time(s).Best regards. Jesus. Edited by user 30 July 2022 06:30:45(UTC)
| Reason: Adding and plotting polygon convex and concave
|
|
|
|
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
Hi Jean, it was a good solution and you give some ideas to do a code but I'd like to do for more lines and I'd like to optimize the code or algorithm. I did a code in smath maybe need to optimize some parts and get some interesting results, i hope you take a look because a I'd like to aply to convex and no convex polygon, I think it's so hard but I'd like to know the algorithm or code that other programs use. My code doesn't work for some slopes though Page5 Polygon Copy.sm (117kb) downloaded 14 time(s).Best regards. Jesus. Edited by user 31 July 2022 02:48:47(UTC)
| Reason: correction
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 15/04/2012(UTC) Posts: 2,046 Was thanked: 1176 time(s) in 752 post(s)
|
Originally Posted by: Jesus_Solano Hi everyone ,I'm doing a momentum curvature usign Popovic's Method and found a big problem beacuse to divide a polygon(convex and concave) into small fiber like this image but with more lines: it's not so easy to do an algorithm. I did a smath file when the polygon it's rectangular but for more general case my smath code doesn't work, I'd like know an algorithm, code or function if it's posible in smath or other language to develop. Best regards. Jesus. Verificacion_de_fluencia_en_acero_fiber_method_degradation_forum.pdf (551kb) downloaded 30 time(s). This might be an application for the GPC wrapper plugin by Davide. gpc1.sm (13kb) downloaded 20 time(s). |
|
|
|
|
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
Thank you so much, mkraska and Jean, I'll take a look this package (GPC wrapper).
Best regards
Jesús.
|
|
|
|
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
Ok Jean, I hope You'll find an algorithm to solve that problem.
Best regards Jesus
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 13/09/2011(UTC) Posts: 66 Location: Kolkata
Was thanked: 9 time(s) in 9 post(s)
|
|
|
|
|
Rank: Newbie
Groups: Registered
Joined: 15/06/2020(UTC) Posts: 6 Location: Lima
|
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
Originally Posted by: loha very exciting project! ... algo style to collapse in utilities.
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 15/04/2012(UTC) Posts: 2,046 Was thanked: 1176 time(s) in 752 post(s)
|
General hatching procedure for arbitrary contours gpc2.sm (43kb) downloaded 23 time(s). |
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 28/08/2014(UTC) Posts: 1,508 Was thanked: 974 time(s) in 609 post(s)
|
Hi. In the attached, a function for see if a point is inside or outside a polygon, and a code for double integrals using Gauss-Legendre coefficients. InPoly.pdf (98kb) downloaded 22 time(s). InPoly.sm (44kb) downloaded 32 time(s).Best regards. Alvaro.
|
1 user thanked Razonar for this useful post.
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 13/09/2011(UTC) Posts: 66 Location: Kolkata
Was thanked: 9 time(s) in 9 post(s)
|
Wow! Will we be able to calculate the static moment and the moment of inertia of any section with these tools?
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 15/04/2012(UTC) Posts: 2,046 Was thanked: 1176 time(s) in 752 post(s)
|
gpc3.sm (136kb) downloaded 53 time(s). |
|
1 user thanked mkraska for this useful post.
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 13/09/2011(UTC) Posts: 66 Location: Kolkata
Was thanked: 9 time(s) in 9 post(s)
|
That's superb! Thanks a lot! Has anyone worked on polyhedra, convex hulls and polar polyhedra?
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
Originally Posted by: loha Has anyone worked on polyhedra, convex hulls and polar polyhedra? I may have something on convex hull Polyhedra, we have C_60 extracted from the adjacency matrix. Jean
|
|
|
|
Rank: Advanced Member Groups: Registered
Joined: 13/09/2011(UTC) Posts: 66 Location: Kolkata
Was thanked: 9 time(s) in 9 post(s)
|
anything on the adjacency matrix I am super interested! Handling the adjacency matrix is the only difficulty in fact. Polarity of points-planes is easy.
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 983 time(s) in 811 post(s)
|
Originally Posted by: loha anything on the adjacency matrix I am super interested! Handling the adjacency matrix is the only difficulty in fact. Polarity of points-planes is easy. 1. In the attached Buckyball, adjacency matrix is from Mathsoft, Mathsoft borrowed fro Matlab. 2. I have the Mathcad convex hull ORIGIN 0 RemToDo ORIGIN 1 for Smath coding. Cheers ... Jean. Buckyball Adjacency.sm (17kb) downloaded 15 time(s). 0Anim Buckyball.sm (108kb) downloaded 13 time(s). Buckyball.sm (177kb) downloaded 17 time(s).
|
1 user thanked Jean Giraud for this useful post.
|
|
|
Rank: Newbie
Groups: Registered
Joined: 05/01/2023(UTC) Posts: 2 Location: Arequipa
|
|
|
|
|
SMath Studio Forum
»
SMath Studio
»
Questions
»
Split Areas(Polygons convex and concave) by lines
Forum Jump
You cannot post new topics in this forum.
You cannot reply to topics in this forum.
You cannot delete your posts in this forum.
You cannot edit your posts in this forum.
You cannot create polls in this forum.
You cannot vote in polls in this forum.