214                 priorityQ.delete(lbnd)
265             # delete the lowest HE, remove all vertex events to do with the 
266             # right HE and delete the right HE
267             edgeList.delete(lbnd)           
268             priorityQ.delete(rbnd)
269             edgeList.delete(rbnd)
295             # if left HE and the new bisector don't intersect, then delete 
299                 priorityQ.delete(llbnd);
561     def delete(self,he):
645     def delete(self,he):

Indexes created Tue Jul 24 14:28:13 CEST 2018