You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As of now, the shells use to define the OnionPartitioning are non-overlapping.
Cross-matching 2 data sets with this implementation will unavoidably lead to miss pairs at the borders.
One idea would be to make overlapping shells as
// To be in OnionPartitioning.scala, LinearOnionPartitioning(...)// Add overlapping shells -- e.g. 1% (to be defined)valextension:Double=0.01for (pos <-0 to numPartitions -1) {
// Inner radius must be greater than 0 (or equal to 0)valinnerRadius= math.max(0.0, pos * dZ * (1- extension))
valouterRadius= (pos +1) * dZ * (1+ extension)
valshell=newShellEnvelope(center, innerRadius, outerRadius)
grids += shell
}
The text was updated successfully, but these errors were encountered:
Not directly this algo (which just defines the grid elements), but I agree we should include in PixelCrossMatch the required method to filter cross-match duplicates.
As of now, the shells use to define the OnionPartitioning are non-overlapping.
Cross-matching 2 data sets with this implementation will unavoidably lead to miss pairs at the borders.
One idea would be to make overlapping shells as
The text was updated successfully, but these errors were encountered: