Macro JointWire/fr: Difference between revisions
m (remplacement des balise <pre> par <syntaxhighlight>) |
(Updating to match new version of source page) |
||
| Line 1: | Line 1: | ||
{{Macro|Icon=Text-x-python|Name=JointWire|Description=This macro allow to find and joint all non connected edge to the closest non connected one using a line. It take a shape matrix in entry ( [shape1,shape2,...])|Author=Tremblou}} |
|||
=Macro_JointWire/fr= |
|||
{{Macro/fr|Icon=Text-x-python|Name=JointWire|Name/fr=JointWire|Description=Cette macro permet de trouver et de mettre en collaboration, à l'aide d'une ligne tous les bords non connectés, avec le plus proche non connecté. Il faudra une entrée sous forme d'une matrice ([shape1, shape2,...])|Author=Tremblou}} |
|||
This macro allow to find and joint all non connected edge to the closest non connected one using a line. It take a shape matrix in entry ( [shape1,shape2,...]) |
|||
<syntaxhighlight> |
<syntaxhighlight> |
||
def findWires(edges): |
def findWires(edges): |
||
def verts(shape): |
def verts(shape): |
||
| Line 64: | Line 67: | ||
joint(result[1]) |
joint(result[1]) |
||
return result[1] |
return result[1] |
||
| ⚫ | |||
| ⚫ | |||
{{languages | {{en|Macro_JointWire}} {{es|Macro_JointWire/es}} {{it|Macro_JointWire/it}} }} |
|||
{{clear}} |
|||
<languages/> |
|||
Revision as of 18:11, 24 December 2013
|
File:Text-x-python JointWire |
| Description |
|---|
| This macro allow to find and joint all non connected edge to the closest non connected one using a line. It take a shape matrix in entry ( [shape1,shape2,...]) Author: Tremblou |
| Author |
| Tremblou |
| Download |
| None |
| Links |
| Macros recipes How to install macros How to customize toolbars |
| Macro Version |
| 1.0 |
| Date last modified |
| None |
| FreeCAD Version(s) |
| None |
| Default shortcut |
| None |
| See also |
| None |
This macro allow to find and joint all non connected edge to the closest non connected one using a line. It take a shape matrix in entry ( [shape1,shape2,...])
def findWires(edges):
def verts(shape):
return [shape.Vertexes[0].Point,shape.Vertexes[-1].Point]
def group(shapes):
shapesIn = shapes[:]
pointTst = []
pointOut =[]
for s in shapesIn :
pointTst=pointTst+[s.Vertexes[0].Point]
pointTst=pointTst+[s.Vertexes[-1].Point]
print pointTst
changed = False
for s in shapesIn:
if len(s.Vertexes) < 2:
print "one vertex, its a circle, just add"
else:
for v in verts(s):
twoDot=0
for vv in pointTst:
if v == vv:
twoDot=twoDot+1
if v==vv and twoDot==2 :
changed = True
print "found matching vert"
break
if twoDot<2:
print "didn't find any matching vert..."
pointOut.append(v)
print "Dots non connected", pointOut
return(changed,pointOut)
def joint(point):
for p in range(len(point)/2) :
print point
deltI=Part.Vertex(100,100,100).Point
pos=1
for pp in range(len(point)-1) :
print "position:",pp+1
if len(point)-1>1:
deltN=(point[0]-point[pp+1])
if deltN.Length<deltI.Length:
deltI=deltN
pos=pp+1
print "changement",pos
else:
pos=1
print "points a joindre",point[0],point[pos]
if point[0]!=point[pos]:
Part.show(Part.makePolygon([point[0],point[pos]]))
else:
print "WARNING les points ont la meme valeurs "
point.pop(0)
point.pop(pos-1)
point=0 #to have a return normally void
return(point)
working = True
edgeSet = edges
result = group(edgeSet)
working = result[0]
edgeSet = result[1]
joint(result[1])
return result[1]