code: @Pure
  	public static int getCohenSutherlandCode(int px, int py, int rxmin, int rymin, int rxmax, int rymax) {
  		assert rxmin <= rxmax : AssertMessages.lowerEqualParameters(2, rxmin, 4, rxmax);
  		assert rymin <= rymax : AssertMessages.lowerEqualParameters(3, rymin, 5, rymax);
  		// initialised as being inside of clip window
  		int code = COHEN_SUTHERLAND_INSIDE;
  		if (px < rxmin) {
  			// to the left of clip window
  			code |= COHEN_SUTHERLAND_LEFT;
  		}
  		if (px > rxmax) {
  			// to the right of clip window
  			code |= COHEN_SUTHERLAND_RIGHT;
  		}
  		if (py < rymin) {
  			// to the bottom of clip window
  			code |= COHEN_SUTHERLAND_BOTTOM;
  		}
  		if (py > rymax) {
  			// to the top of clip window
  			code |= COHEN_SUTHERLAND_TOP;
  		}
  		return code;
  	}
docs: Compute the zone where the point is against the given rectangle
  according to the <a href="http://en.wikipedia.org/wiki/Cohen%E2%80%93Sutherland_algorithm">Cohen-Sutherland algorithm</a>.
  
  @param px is the coordinates of the points.
  @param py is the coordinates of the points.
  @param rxmin is the min of the coordinates of the rectangle.
  @param rymin is the min of the coordinates of the rectangle.
  @param rxmax is the max of the coordinates of the rectangle.
  @param rymax is the max of the coordinates of the rectangle.
  @return the zone
  @see MathConstants#COHEN_SUTHERLAND_BOTTOM
  @see MathConstants#COHEN_SUTHERLAND_TOP
  @see MathConstants#COHEN_SUTHERLAND_LEFT
  @see MathConstants#COHEN_SUTHERLAND_RIGHT
  @see MathConstants#COHEN_SUTHERLAND_INSIDE