1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
<!doctype html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module skeinforge_tools.skeinforge_utilities.intercircle</title>
</head><body bgcolor="#f0f0f8">
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"> <br><big><big><strong><a href="skeinforge_tools.html"><font color="#ffffff">skeinforge_tools</font></a>.<a href="skeinforge_tools.skeinforge_utilities.html"><font color="#ffffff">skeinforge_utilities</font></a>.intercircle</strong></big></big> ($Date: 2008/21/04 $)</font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="file:/home/enrique/Desktop/backup/babbleold/script/reprap/pyRepRap/skeinforge_tools/skeinforge_utilities/intercircle.py">/home/enrique/Desktop/backup/babbleold/script/reprap/pyRepRap/skeinforge_tools/skeinforge_utilities/intercircle.py</a></font></td></tr></table>
<p><tt>Intercircle is a collection of utilities for intersecting circles, used to get smooth loops around a collection of points and inset & outset loops.</tt></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#aa55cc">
<td colspan=3 valign=bottom> <br>
<font color="#fffff" face="helvetica, arial"><big><strong>Modules</strong></big></font></td></tr>
<tr><td bgcolor="#aa55cc"><tt> </tt></td><td> </td>
<td width="100%"><table width="100%" summary="list"><tr><td width="25%" valign=top><a href="__init__.html">__init__</a><br>
</td><td width="25%" valign=top><a href="skeinforge_tools.skeinforge_utilities.euclidean.html">skeinforge_tools.skeinforge_utilities.euclidean</a><br>
</td><td width="25%" valign=top><a href="math.html">math</a><br>
</td><td width="25%" valign=top></td></tr></table></td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ee77aa">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Classes</strong></big></font></td></tr>
<tr><td bgcolor="#ee77aa"><tt> </tt></td><td> </td>
<td width="100%"><dl>
<dt><font face="helvetica, arial"><a href="skeinforge_tools.skeinforge_utilities.intercircle.html#BoundingLoop">BoundingLoop</a>
</font></dt><dt><font face="helvetica, arial"><a href="skeinforge_tools.skeinforge_utilities.intercircle.html#CircleIntersection">CircleIntersection</a>
</font></dt><dt><font face="helvetica, arial"><a href="skeinforge_tools.skeinforge_utilities.intercircle.html#CircleNode">CircleNode</a>
</font></dt></dl>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom> <br>
<font color="#000000" face="helvetica, arial"><a name="BoundingLoop">class <strong>BoundingLoop</strong></a></font></td></tr>
<tr bgcolor="#ffc8d8"><td rowspan=2><tt> </tt></td>
<td colspan=2><tt>A class to hold a bounding loop composed of a minimum complex, a maximum complex and an outset loop.<br> </tt></td></tr>
<tr><td> </td>
<td width="100%">Methods defined here:<br>
<dl><dt><a name="BoundingLoop-__eq__"><strong>__eq__</strong></a>(self, other)</dt><dd><tt>Determine whether this bounding loop is identical to other one.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-__repr__"><strong>__repr__</strong></a>(self)</dt><dd><tt>Get the string representation of this bounding loop.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-getFromLoop"><strong>getFromLoop</strong></a>(self, loop)</dt><dd><tt>Get the bounding loop from a path.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-getOutsetBoundingLoop"><strong>getOutsetBoundingLoop</strong></a>(self, outsetDistance)</dt><dd><tt>Outset the bounding rectangle and loop by a distance.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-isEntirelyInsideAnother"><strong>isEntirelyInsideAnother</strong></a>(self, anotherBoundingLoop)</dt><dd><tt>Determine if this bounding loop is entirely inside another bounding loop.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-isOverlappingAnother"><strong>isOverlappingAnother</strong></a>(self, anotherBoundingLoop)</dt><dd><tt>Determine if this bounding loop is intersecting another bounding loop.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-isOverlappingAnotherInList"><strong>isOverlappingAnotherInList</strong></a>(self, boundingLoops)</dt><dd><tt>Determine if this bounding loop is intersecting another bounding loop in a list.</tt></dd></dl>
<dl><dt><a name="BoundingLoop-isRectangleMissingAnother"><strong>isRectangleMissingAnother</strong></a>(self, anotherBoundingLoop)</dt><dd><tt>Determine if the rectangle of this bounding loop is missing the rectangle of another bounding loop.</tt></dd></dl>
</td></tr></table> <p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom> <br>
<font color="#000000" face="helvetica, arial"><a name="CircleIntersection">class <strong>CircleIntersection</strong></a></font></td></tr>
<tr bgcolor="#ffc8d8"><td rowspan=2><tt> </tt></td>
<td colspan=2><tt>An intersection of two complex circles.<br> </tt></td></tr>
<tr><td> </td>
<td width="100%">Methods defined here:<br>
<dl><dt><a name="CircleIntersection-__init__"><strong>__init__</strong></a>(self, circleNodeAhead, index, circleNodeBehind)</dt></dl>
<dl><dt><a name="CircleIntersection-__repr__"><strong>__repr__</strong></a>(self)</dt><dd><tt>Get the string representation of this <a href="#CircleIntersection">CircleIntersection</a>.</tt></dd></dl>
<dl><dt><a name="CircleIntersection-addToList"><strong>addToList</strong></a>(self, circleIntersectionPath)</dt><dd><tt>Add this to the circle intersection path, setting stepped on to be true.</tt></dd></dl>
<dl><dt><a name="CircleIntersection-getAbsolutePosition"><strong>getAbsolutePosition</strong></a>(self)</dt><dd><tt>Get the absolute position.</tt></dd></dl>
<dl><dt><a name="CircleIntersection-getCircleIntersectionAhead"><strong>getCircleIntersectionAhead</strong></a>(self)</dt><dd><tt>Get the first circle intersection on the circle node ahead.</tt></dd></dl>
<dl><dt><a name="CircleIntersection-isWithinCircles"><strong>isWithinCircles</strong></a>(self, pixelTable)</dt><dd><tt>Determine if this circle intersection is within the circle node circles.</tt></dd></dl>
</td></tr></table> <p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom> <br>
<font color="#000000" face="helvetica, arial"><a name="CircleNode">class <strong>CircleNode</strong></a></font></td></tr>
<tr bgcolor="#ffc8d8"><td rowspan=2><tt> </tt></td>
<td colspan=2><tt>A complex node of complex circle intersections.<br> </tt></td></tr>
<tr><td> </td>
<td width="100%">Methods defined here:<br>
<dl><dt><a name="CircleNode-__init__"><strong>__init__</strong></a>(self, circle, index)</dt></dl>
<dl><dt><a name="CircleNode-__repr__"><strong>__repr__</strong></a>(self)</dt><dd><tt>Get the string representation of this <a href="#CircleNode">CircleNode</a>.</tt></dd></dl>
<dl><dt><a name="CircleNode-getWithinNodes"><strong>getWithinNodes</strong></a>(self, pixelTable)</dt><dd><tt>Get the nodes this circle node is within.</tt></dd></dl>
</td></tr></table></td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#eeaa77">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Functions</strong></big></font></td></tr>
<tr><td bgcolor="#eeaa77"><tt> </tt></td><td> </td>
<td width="100%"><dl><dt><a name="-addCircleIntersectionLoop"><strong>addCircleIntersectionLoop</strong></a>(circleIntersectionPaths, circleIntersections)</dt><dd><tt>Add a circle intersection loop.</tt></dd></dl>
<dl><dt><a name="-addOrbits"><strong>addOrbits</strong></a>(distanceFeedRate, loop, orbitalFeedRatePerSecond, temperatureChangeTime, z)</dt><dd><tt>Add orbits with the extruder off.</tt></dd></dl>
<dl><dt><a name="-addOrbitsIfLarge"><strong>addOrbitsIfLarge</strong></a>(distanceFeedRate, loop, orbitalFeedRatePerSecond, temperatureChangeTime, z)</dt><dd><tt>Add orbits with the extruder off if the orbits are large enough.</tt></dd></dl>
<dl><dt><a name="-addPointsFromSegment"><strong>addPointsFromSegment</strong></a>(pointBegin, pointEnd, points, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Add point complexes between the endpoints of a segment.</tt></dd></dl>
<dl><dt><a name="-getAroundsFromLoop"><strong>getAroundsFromLoop</strong></a>(loop, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the arounds from the loop, later combine with get arounds.</tt></dd></dl>
<dl><dt><a name="-getAroundsFromLoops"><strong>getAroundsFromLoops</strong></a>(loops, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the arounds from the loops.</tt></dd></dl>
<dl><dt><a name="-getAroundsFromPoints"><strong>getAroundsFromPoints</strong></a>(points, radius)</dt><dd><tt>Get the arounds from the points.</tt></dd></dl>
<dl><dt><a name="-getCentersFromCircleNodes"><strong>getCentersFromCircleNodes</strong></a>(circleNodes, radius)</dt><dd><tt>Get the complex centers of the circle intersection loops from circle nodes.</tt></dd></dl>
<dl><dt><a name="-getCentersFromIntersectionLoop"><strong>getCentersFromIntersectionLoop</strong></a>(circleIntersectionLoop, radius)</dt><dd><tt>Get the centers from the intersection loop.</tt></dd></dl>
<dl><dt><a name="-getCentersFromIntersectionLoops"><strong>getCentersFromIntersectionLoops</strong></a>(circleIntersectionLoops, radius)</dt><dd><tt>Get the centers from the intersection loops.</tt></dd></dl>
<dl><dt><a name="-getCentersFromLoop"><strong>getCentersFromLoop</strong></a>(loop, radius)</dt><dd><tt>Get the centers of the loop.</tt></dd></dl>
<dl><dt><a name="-getCentersFromLoopDirection"><strong>getCentersFromLoopDirection</strong></a>(isWiddershins, loop, radius)</dt><dd><tt>Get the centers of the loop which go around in the given direction.</tt></dd></dl>
<dl><dt><a name="-getCentersFromPoints"><strong>getCentersFromPoints</strong></a>(points, radius)</dt><dd><tt>Get the centers from the points.</tt></dd></dl>
<dl><dt><a name="-getCircleIntersectionLoops"><strong>getCircleIntersectionLoops</strong></a>(circleIntersections)</dt><dd><tt>Get all the loops going through the circle intersections.</tt></dd></dl>
<dl><dt><a name="-getCircleIntersectionsFromCircleNodes"><strong>getCircleIntersectionsFromCircleNodes</strong></a>(circleNodes)</dt><dd><tt>Get all the circle intersections which exist between all the circle nodes.</tt></dd></dl>
<dl><dt><a name="-getCircleNodesFromLoop"><strong>getCircleNodesFromLoop</strong></a>(loop, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the circle nodes from every point on a loop and between points.</tt></dd></dl>
<dl><dt><a name="-getCircleNodesFromPoints"><strong>getCircleNodesFromPoints</strong></a>(points, radius)</dt><dd><tt>Get the circle nodes from a path.</tt></dd></dl>
<dl><dt><a name="-getInsetFromClockwiseLoop"><strong>getInsetFromClockwiseLoop</strong></a>(loop, radius)</dt><dd><tt>Get loop inset from clockwise loop, out from widdershins loop.</tt></dd></dl>
<dl><dt><a name="-getInsetFromClockwiseTriple"><strong>getInsetFromClockwiseTriple</strong></a>(aheadAbsolute, behindAbsolute, center, radius)</dt><dd><tt>Get loop inset from clockwise triple, out from widdershins loop.</tt></dd></dl>
<dl><dt><a name="-getInsetLoopsFromLoop"><strong>getInsetLoopsFromLoop</strong></a>(inset, loop, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the inset loops, which might overlap.</tt></dd></dl>
<dl><dt><a name="-getInsetLoopsFromLoops"><strong>getInsetLoopsFromLoops</strong></a>(inset, loops)</dt><dd><tt>Get the inset loops, which might overlap.</tt></dd></dl>
<dl><dt><a name="-getInsetSeparateLoopsFromLoops"><strong>getInsetSeparateLoopsFromLoops</strong></a>(inset, loops, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the separate inset loops.</tt></dd></dl>
<dl><dt><a name="-getIntersectionAtInset"><strong>getIntersectionAtInset</strong></a>(ahead, behind, inset)</dt><dd><tt>Get circle intersection loop at inset from segment.</tt></dd></dl>
<dl><dt><a name="-getLargestInsetLoopFromLoop"><strong>getLargestInsetLoopFromLoop</strong></a>(loop, radius)</dt><dd><tt>Get the largest inset loop from the loop.</tt></dd></dl>
<dl><dt><a name="-getLargestInsetLoopFromLoopNoMatterWhat"><strong>getLargestInsetLoopFromLoopNoMatterWhat</strong></a>(loop, radius)</dt><dd><tt>Get the largest inset loop from the loop, even if the radius has to be shrunk and even if there is still no inset loop.</tt></dd></dl>
<dl><dt><a name="-getLoopsFromLoopsDirection"><strong>getLoopsFromLoopsDirection</strong></a>(isWiddershins, loops)</dt><dd><tt>Get the loops going round in a given direction.</tt></dd></dl>
<dl><dt><a name="-getPointsFromLoop"><strong>getPointsFromLoop</strong></a>(loop, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the points from every point on a loop and between points.</tt></dd></dl>
<dl><dt><a name="-getPointsFromLoops"><strong>getPointsFromLoops</strong></a>(loops, radius, thresholdRatio<font color="#909090">=0.90000000000000002</font>)</dt><dd><tt>Get the points from every point on a loop and between points.</tt></dd></dl>
<dl><dt><a name="-getSimplifiedInsetFromClockwiseLoop"><strong>getSimplifiedInsetFromClockwiseLoop</strong></a>(loop, radius)</dt><dd><tt>Get loop inset from clockwise loop, out from widdershins loop.</tt></dd></dl>
<dl><dt><a name="-getWithoutIntersections"><strong>getWithoutIntersections</strong></a>(loop)</dt><dd><tt>Get loop without intersections.</tt></dd></dl>
<dl><dt><a name="-isLargeSameDirection"><strong>isLargeSameDirection</strong></a>(inset, loop, radius)</dt><dd><tt>Determine if the inset is in the same direction as the loop and it is large enough.</tt></dd></dl>
<dl><dt><a name="-isLoopIntersectingLoop"><strong>isLoopIntersectingLoop</strong></a>(anotherLoop, loop)</dt><dd><tt>Determine if the a loop is intersecting another loop.</tt></dd></dl>
<dl><dt><a name="-orbitsAreLarge"><strong>orbitsAreLarge</strong></a>(loop, temperatureChangeTime)</dt><dd><tt>Determine if the orbits are large enough.</tt></dd></dl>
<dl><dt><a name="-removeIntersection"><strong>removeIntersection</strong></a>(loop)</dt><dd><tt>Get loop without the first intersection.</tt></dd></dl>
</td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#55aa55">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Data</strong></big></font></td></tr>
<tr><td bgcolor="#55aa55"><tt> </tt></td><td> </td>
<td width="100%"><strong>__author__</strong> = 'Enrique Perez (perez_enrique@yahoo.com)'<br>
<strong>__date__</strong> = '$Date: 2008/21/04 $'<br>
<strong>__license__</strong> = 'GPL 3.0'<br>
<strong>absolute_import</strong> = _Feature((2, 5, 0, 'alpha', 1), (2, 7, 0, 'alpha', 0), 16384)</td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#7799ee">
<td colspan=3 valign=bottom> <br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Author</strong></big></font></td></tr>
<tr><td bgcolor="#7799ee"><tt> </tt></td><td> </td>
<td width="100%">Enrique Perez (perez_enrique@yahoo.com)</td></tr></table>
</body></html>
|
