self.posLabel=tk.Label(bar,width=16,text="(,)")

		self.posLabel.pack(side=LEFT)

		self.colorLabel=tk.Label(bar,width=20,text="HSV: (,,)")

		self.colorLabel.pack(side=LEFT)

		return bar

	def _markCorners(self):

		self.canvas.delete("mark")

		for c in self.corners:

			(x,y)=(c.x,c.y)

			self.canvas.create_oval(x-2,y-2,x+2,y+2,fill="#00ff00",tags="mark")

			(a,b,c,d)=self.corners

			self.canvas.create_line(a.x,a.y,b.x,b.y,fill="#00ff00",tags="mark")

			self.canvas.create_line(b.x,b.y,c.x,c.y,fill="#00ff00",tags="mark")

			self.canvas.create_line(c.x,c.y,d.x,d.y,fill="#00ff00",tags="mark")

			self.canvas.create_line(d.x,d.y,a.x,a.y,fill="#00ff00",tags="mark")

class DataFile(MutableMapping):

	"""self._data: {filename: [EPoint,EPoint,EPoint,EPoint]}"""

	def __init__(self,filename):

		self.filename=filename

		try:

import logging

from .epoint import EPoint

log=logging.getLogger(__name__)

class Corners:

	def __init__(self,cornerList=[]):

		self._corners=cornerList[:]

	## Adds a new corner if there are less than four, replaces the closest otherwise.

	def add(self,x,y):

		a=EPoint(x,y)

		# for i,c in enumerate(self.corners): # move an improperly placed point

			# if a.dist(c)<20:

				# self.corners[i]=a

				# return

		if len(self._corners)<4: # add a new corner

			self._corners.append(a)

		if len(self._corners)<4:

			return

		index,minDist=0,float('inf') # replace the corner closest to the clicked point

		for i,c in enumerate(self._corners):

			if a.dist(c)<minDist:

				index,minDist=i,a.dist(c)

		self._corners[index]=a

	## Order the corners (0,1,2,3) so they make a quadrangle with vertices KLMN in counter-clockwise order, K being in the upper left.

	#

	#  For four points ABCD, there are 24 possible permutations corresponding to the desired KLMN.

	#  When we relax the condition of K being the upper left one, we get six groups of four equivalent permutations. KLMN ~ LMNK ~ MNKL ~ NKLM.

	#

	#  We determine which of the points' triplets are oriented clockwise and which counter-clockwise (minus/plus in the table below)

	#  and swap them so that all triangles turn counter-clockwise.

	#

	#  xxxx -> KLMN | ABC | ABD | ACD | BCD | index | swap

	#  ------------ | :-: | :-: | :-: | :-: | ----: | ----

	#  A BCD        |  +  |  +  |  +  |  +  |    15 | 0

	#  A BDC        |  +  |  +  |  -  |  -  |    12 | CD

	#  A CBD        |  -  |  +  |  +  |  -  |     6 | BC

	#  A CDB        |  -  |  -  |  +  |  +  |     3 | AB

	#  A DBC        |  +  |  -  |  -  |  +  |     9 | AD

	#  A DCB        |  -  |  -  |  -  |  -  |     0 | BD

	#

	#  For every non-degenerate quadrangle, there must be 1-3 edges going right-left (from a higher to a lower x coordinate).

	#  From these pick the one with the lowest slope (dy/dx) and declare its ending point the upper left corner. For the same slope pick the one further left.

	#

	#  @return True for a convex quadrangle, False for concave and degenerate cases.

		a,b,c,d=self._corners

		abc=doubleTriangleArea(a,b,c)

		abd=doubleTriangleArea(a,b,d)

		acd=doubleTriangleArea(a,c,d)

		bcd=doubleTriangleArea(b,c,d)

		swaps=[(1,3),(0,1),(1,2),(0,3),(2,3),(0,0)]

		index=(8 if abc>0 else 0)|(4 if abd>0 else 0)|(2 if acd>0 else 0)|(1 if bcd>0 else 0)

		if index%3!=0: return False # concave degenerate

		swap=swaps[index//3]

		self._corners[swap[0]], self._corners[swap[1]] = self._corners[swap[1]], self._corners[swap[0]] # counter-clockwise order

		kIndex=None

		lowestSlope=float("inf")

		for i,corner in enumerate(self._corners): # find the NK edge: going right-left with the lowest slope, secondarily the one going down

			ii=(i+1)%4

			slope=abs(getSlope(corner, self._corners[ii]))

			if corner.x>self._corners[ii].x and (slope < lowestSlope or (slope == lowestSlope and corner.y < self._corners[ii].y)):

				kIndex=ii

				lowestSlope=slope

		self._corners= self._corners[kIndex:] + self._corners[:kIndex] # rotate the upper left corner to the first place

		log.debug(self._corners)

	def scale(self,scale):

		self._corners=[c * scale for c in self._corners]

	def __iter__(self):

		return iter(self._corners)

	def __len__(self):

		return len(self._corners)

## Computes twice the area of the triangle formed by points a,b,c.

#

#  @return positive value for points oriented counter-clockwise, negative for clockwise, zero for degenerate cases.

def doubleTriangleArea(a,b,c):

	return (a.x-b.x)*(c.y-a.y)-(c.x-a.x)*(a.y-b.y)

def getSlope(a,b):

	if(b.x==a.x): return float("inf")

	return (b.y-a.y)/(b.x-a.x)

class Grid:

	## Creates a Grid from the provided Corners object.

	#

	#  Finds the vanishing points of the board lines (corner points define perspectively transformed parallel lines). The vanishing points define the image horizon.

	#

	#  The horizon can be used to construct a matrix for affine rectification of the image (restoring parallel lines parallelism). We transform the corner points by this matrix,

	#  interpolate them to get proper intersections' coordinates and then transform these back to get their placement at the original image.

	#

	#  The result is stored in grid.intersections, a boardSize*boardSize list with [row][column] coordinates.

	#

	# !! Needs a check for proper initialization.

	def __init__(self,corners):

		# ad

		# bc

		a,b,c,d=[c.toProjective() for c in corners]

		p1=numpy.cross(a,b)

		p2=numpy.cross(c,d)

		vanish1=numpy.cross(p1,p2)

		# !! 32 bit int can overflow. keeping it reasonably small. might want to use a cleaner solution

		vanish1=EPoint.fromProjective(vanish1).toProjective() # !! EPoint fails with point in infinity

			for r in range(19):

				for c in range(19):

					((r1,c1),(r2,c2))=analyzer.relevantRect(self._boardGrid.intersections[r][c], *(self._boardGrid.stoneSizeAt(r, c)))

					self.create_rectangle(r1,c1,r2,c2,outline="#00ffff")

	def setImg(self,img):

		self._img=img

	## Stores a grid corner located at x,y coordinates.

	def addCorner(self,x,y):

		self._corners.add(x,y)

		log.debug("click on %d,%d",x,y)

			# transform corners from show coordinates to real coordinates

			self._boardGrid=Grid(self._corners)

			corners=[self._transformPoint(c) for c in self._corners]

			self._gui.detector.setCorners(corners)

			self._gui.preview()

		self.redraw()

	## Marks a point at the image with a green cross. Used for corners.

	def markPoint(self,x,y):

		self.create_line(x-3,y-3,x+4,y+4,fill="#00ff00")

		self.create_line(x-3,y+3,x+4,y-4,fill="#00ff00")