def getWithinNodes( self, pixelTable ): "Get the nodes this circle node is within." withinNodes = [] squareValues = euclidean.getSquareValuesFromPoint( pixelTable, 0.5 * self.circle ) for squareValue in squareValues: if abs( self.circle - squareValue.circle ) < 2.0: withinNodes.append( squareValue ) return withinNodes
def getWithinNodes( self, pixelTable, width ): "Get the nodes this circle node is within." circleOverWidth = self.circle / width withinNodes = [] squareValues = euclidean.getSquareValuesFromPoint( pixelTable, circleOverWidth ) for squareValue in squareValues: if abs( self.circle - squareValue.circle ) < self.diameter: withinNodes.append( squareValue ) return withinNodes
def getWithinNodes(self, pixelTable):
"Get the nodes this circle node is within."
withinNodes = []
squareValues = euclidean.getSquareValuesFromPoint(
pixelTable, 0.5 * self.circle)
for squareValue in squareValues:
if abs(self.circle - squareValue.circle) < 2.0:
withinNodes.append(squareValue)
return withinNodes
def isWithinCircles( self, pixelTable ): "Determine if this circle intersection is within the circle node circles." absolutePosition = self.getAbsolutePosition() squareValues = euclidean.getSquareValuesFromPoint( pixelTable, absolutePosition ) for squareValue in squareValues: if abs( squareValue.circle - absolutePosition ) < 1.0: if squareValue != self.circleNodeAhead and squareValue != self.circleNodeBehind: return True return False
def isWithinCircles(self, pixelTable):
"Determine if this circle intersection is within the circle node circles."
absolutePosition = self.getAbsolutePosition()
squareValues = euclidean.getSquareValuesFromPoint(
pixelTable, absolutePosition)
for squareValue in squareValues:
if abs(squareValue.circle - absolutePosition) < 1.0:
if squareValue != self.circleNodeAhead and squareValue != self.circleNodeBehind:
return True
return False