UnstructuredPoints3D

Returns the smallest continuous box domain that fully contains all the domain points.

The bounding box is always oriented along the dimensions of the space (i.e. this method does not return rotated boxes)

Computes the center of moss of the points in this pointSet

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

• It is reflexive: for any instance x of type Any, x.equals(x) should return true.
• It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

• Returns the point belonging to the domain that is closest to the indicated position. The point identifier within th e domain is also returned.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

• Returns the domain points in n chunks. Each chunk of the points is given as an iterator

The main idea behind this method is to be able to easily parallelize on the domain points, as parallel operations on a single iterator in Scala end up more costly than sequential access in our case. Using this method, one would parallelize on the Seq of iterators instead.