main/src/georegression/geometry/UtilPolygons2D_I32.java
public static void bounding( List<Point2D_I32> points , Rectangle2D_I32 rectangle ) {

		rectangle.x0 = Integer.MAX_VALUE;
		rectangle.y0 = Integer.MAX_VALUE;
		rectangle.x1 = Integer.MIN_VALUE;
		rectangle.y1 = Integer.MIN_VALUE;

		for( int i = 0; i < points.size(); i++ ) {
			Point2D_I32 p = points.get(i);

			if( p.x < rectangle.x0 )
				rectangle.x0 = p.x;
			if( p.x > rectangle.x1 )
				rectangle.x1 = p.x;
			if( p.y < rectangle.y0 )
				rectangle.y0 = p.y;
			if( p.y > rectangle.y1 )
				rectangle.y1 = p.y;
		}

		rectangle.x1++;
		rectangle.y1++;
	}
public static void bounding( List<Point2D_I32> points , Rectangle2D_I32 rectangle ) {

		rectangle.x0 = Integer.MAX_VALUE;
		rectangle.y0 = Integer.MAX_VALUE;
		rectangle.x1 = Integer.MIN_VALUE;
		rectangle.y1 = Integer.MIN_VALUE;

		for( int i = 0; i < points.size(); i++ ) {
			Point2D_I32 p = points.get(i);

			if( p.x < rectangle.x0 )
				rectangle.x0 = p.x;
			if( p.x > rectangle.x1 )
				rectangle.x1 = p.x;
			if( p.y < rectangle.y0 )
				rectangle.y0 = p.y;
			if( p.y > rectangle.y1 )
				rectangle.y1 = p.y;
		}

		rectangle.x1++;
		rectangle.y1++;
	}
public static void bounding ( List < Point2D_I32 > points , Rectangle2D_I32 rectangle ) { rectangle . x0 = Integer . MAX_VALUE ; rectangle . y0 = Integer . MAX_VALUE ; rectangle . x1 = Integer . MIN_VALUE ; rectangle . y1 = Integer . MIN_VALUE ; for ( int i = 0 ; i < points . size ( ) ; i ++ ) { Point2D_I32 p = points . get ( i ) ; if ( p . x < rectangle . x0 ) rectangle . x0 = p . x ; if ( p . x > rectangle . x1 ) rectangle . x1 = p . x ; if ( p . y < rectangle . y0 ) rectangle . y0 = p . y ; if ( p . y > rectangle . y1 ) rectangle . y1 = p . y ; } rectangle . x1 ++ ; rectangle . y1 ++ ; }
Finds the minimum area bounding rectangle which is aligned to the x and y axis around the list of points.
Note (x0,y0) is inclusive and (x1,y1) is exclusive.

@param points (Input) Quadrilateral
@param rectangle (Output) Minimum area rectangle
Finds the minimum area bounding rectangle which is aligned to the x and y axis around the list of points . Note ( x0 y0 ) is inclusive and ( x1 y1 ) is exclusive .