Lines Matching refs:bisector
205 # this new bisector edge between the left and right vectors in
207 bisector = Halfedge(edge,Edge.LE)
208 edgeList.insert(lbnd,bisector)
210 # if the new bisector intersects with the left edge, remove
212 p = lbnd.intersect(bisector)
218 # insert the new Halfedge to the right of the original bisector
219 lbnd = bisector
220 bisector = Halfedge(edge,Edge.RE)
221 edgeList.insert(lbnd,bisector)
223 # if this new bisector intersects with the right Halfedge
224 p = bisector.intersect(rbnd)
227 priorityQ.insert(bisector,p,newsite.distance(p))
285 bisector = Halfedge(edge, pm)
287 # insert the new bisector to the right of the left HE
289 # If the site to the left of this bisector is higher than the right
291 edgeList.insert(llbnd, bisector)
295 # if left HE and the new bisector don't intersect, then delete
297 p = llbnd.intersect(bisector)
302 # if right HE and the new bisector don't intersect, then reinsert it
303 p = bisector.intersect(rrbnd)
305 priorityQ.insert(bisector, p, bot.distance(p))
379 # to begin with, there are no endpoints on the bisector - it goes to infinity