Class: IntervalSize

jsts.index.IntervalSize

new IntervalSize()

Provides a test for whether an interval is so small it should be considered as zero for the purposes of inserting it into a binary tree. The reason this check is necessary is that round-off error can cause the algorithm used to subdivide an interval to fail, by computing a midpoint value which does not lie strictly between the endpoints.
Source:

Members

(static) MIN_BINARY_EXPONENT

This value is chosen to be a few powers of 2 less than the number of bits available in the double representation (i.e. 53). This should allow enough extra precision for simple computations to be correct, at least for comparison purposes.
Source:

Methods

(static) isZeroWidth(min, max) → {Boolean}

Computes whether the interval [min, max] is effectively zero width. I.e. the width of the interval is so much less than the location of the interval that the midpoint of the interval cannot be represented precisely.
Parameters:
Name Type Description
min Number the min-value in the interval.
max Number the max-value in the interval.
Source:
Returns:
true if the interval should be considered zero.
Type
Boolean