//double min = (tile.avgedge/tile.numedges)*(1+(4/(double)verts));
//if (verts>0 && tile.es.peek().length() < min) return;
PriorityQueue<Geom.E> es = new PriorityQueue<Geom.E>();
for(Geom.E e : tile.es) es.add(e);
//double min = (tile.avgedge/tile.numedges)*(1+(4/(double)verts));
//if (verts>0 && tile.es.peek().length() < min) return;
PriorityQueue<Geom.E> es = new PriorityQueue<Geom.E>();
for(Geom.E e : tile.es) es.add(e);