PixelCrossMatch
Related Doc:
package spatialOperator
Cross match 2 RDD based on the healpix index of geometry center.
Cross match 2 RDD based on the healpix index of geometry center. The cross-match is done partition-by-partition, which means the two RDD must have been partitioned by the same partitioner. You have to choice to return: (1) Elements of (A, B) matching (returnType="AB") (2) Elements of A matching B (returnType="A") (3) Elements of B matching A (returnType="B") (4) Healpix pixel indices matching (returnType="healpix")
Which one you should choose? That depends on what you need: (1) gives you all elements but is slow. (2) & (3) give you all elements only in one side but is faster. (4) gives you only healpix center but is even faster.
: (RDD[A<:Shape3D]) RDD whose elements are Shape3D or any extension (Point3D, ...)
: (RDD[B<:Shape3D]) RDD whose elements are Shape3D or any extension (Point3D, ...)
: (Int) Resolution of the underlying healpix map used to convert angle coordinates to healpix index.
: (String) Kind of crossmatch to perform:
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return all elements matching as tuple(A, B).
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return all elements matching as tuple(A, B).
: (Iterator[A]) Iterator containing elements of A in a partition
: (Iterator[B]) Iterator containing elements of B in the same partition
: (Int) Resolution of the healpix grid.
(Iterator[(A, B)]) iterator containing A and B elements matching.
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return elements of B which match with A.
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return elements of B which match with A.
: (Iterator[A]) Iterator containing elements of A in a partition
: (Iterator[B]) Iterator containing elements of B in the same partition
: (Int) Resolution of the healpix grid.
(Iterator[B]) iterator containing elements of B matching with A.
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return healpix indices found in both partitions.
Perform a cross match between partition A and partition B based on the healpix index of object centers, and return healpix indices found in both partitions. Duplicates are removed in the sense we do not keep the multiplicity for each pixel.
: (Iterator[A]) Iterator containing elements of A in a partition
: (Iterator[B]) Iterator containing elements of B in the same partition
: (Int) Resolution of the healpix grid.
(Iterator[Long]) iterator containing healpix indices matching.
Object containing routines to perform cross match between two sets A & B based on an underlying pixelisation. The space is first pixelised, and match is done between cells of this pixelisation. As a first example, we include the Healpix pixelisation (2D pixelisation). Each RDD partition is a shell, projected on a 2D plan, and pixelized.