The bottom is defined as the center y coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square.
The bottom is defined as the center y coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square. This was changed from the previous definition of 'cy + extent' to be able to use the full 31 bit signed int space for a square without resorting to long conversion.
Checks whether a given square is fully contained in this square.
Checks whether a given square is fully contained in this square. This is also the case if their bounds full match.
Queries the overlap of this shape with a given
IntPoint2D p.
Queries the overlap of this shape with a given
IntPoint2D p. The point is considered to have
a side length of 1!
true if this shape contains or partly overlaps
the given point
Calculates the greatest interesting hyper-cube inside this hyper-cube which
contains both hyper-cube a and point b, and they occupy distinct orthants.
Calculates the greatest interesting hyper-cube inside this hyper-cube which
contains both hyper-cube a and point b, and they occupy distinct orthants.
Calculates the greatest interesting hyper-cube inside this hyper-cube which
contains both points a and b, and they occupy distinct orthants.
Calculates the greatest interesting hyper-cube inside this hyper-cube which
contains both points a and b, and they occupy distinct orthants.
Determines the quadrant index of another internal square aq.
Determines the quadrant index of another internal square aq.
the index of the quadrant (beginning at 0), or -1 if aq lies
outside of this square.
Determines the quadrant index of a point a.
Determines the quadrant index of a point a.
the index of the quadrant (beginning at 0), or -1 if a lies
outside of this square.
Calculates the maximum distance to a point in the euclidean metric.
Calculates the maximum distance to a point in the euclidean metric.
This calls maxDistanceSq and then takes the square root.
Calculates the maximum squared distance to a point in the euclidean metric.
Calculates the maximum squared distance to a point in the euclidean metric.
This is the distance (squared) to the corner which is the furthest from
the point, no matter if it lies within the square or not.
Calculates the minimum distance to a point in the euclidean metric.
Calculates the minimum distance to a point in the euclidean metric.
This calls minDistanceSq and then takes the square root.
The squared (euclidean) distance of the closest of the square's corners or sides to the point, if the point is outside the square, or zero, if the point is contained
The right is defined as the center x coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square.
The right is defined as the center x coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square. This was changed from the previous definition of 'cx + extent' to be able to use the full 31 bit signed int space for a square without resorting to long conversion.
The side length is two times the extent.
The side length is two times the extent. Note that this may overflow if the extent
is greater than 0x3FFFFFFF.
The top is center-y minus the extent.
The top is center-y minus the extent.
Note therefore, that the vertical coordinates are considered top-down as in screen coordinates, not bottom-up!