def get_bound(pts):
 (x0, y0, x1, y1) = (INF, INF, (- INF), (- INF))
 for (x, y) in pts:
  x0 = min(x0, x)
  y0 = min(y0, y)
  x1 = max(x1, x)
  y1 = max(y1, y)
 return (x0, y0, x1, y1)

def get_bound ( pts ) : ( x0 , y0 , x1 , y1 ) = ( INF , INF , ( - INF ) , ( - INF ) ) for ( x , y ) in pts : x0 = min ( x0 , x ) y0 = min ( y0 , y ) x1 = max ( x1 , x ) y1 = max ( y1 , y ) return ( x0 , y0 , x1 , y1 )
compute a minimal rectangle that covers all the points .