lsst.geom
14.0-1-g7257b6a+15
|
Public Member Functions | |
def | __init__ (self, numStripes, numSubStripesPerStripe) |
def | getSubStripe (self, phi) |
def | getStripe (self, phi) |
def | getSubChunk (self, subStripe, theta) |
def | getChunk (self, stripe, theta) |
def | getChunkBoundingBox (self, chunkId) |
def | getSubChunkBoundingBox (self, chunkId, subChunkId) |
def | getChunkId (self, stripe, chunk) |
def | getSubChunkId (self, subStripe, subChunk) |
def | intersect (self, args) |
def | __iter__ (self) |
def | __eq__ (self, other) |
def | __repr__ (self) |
Public Attributes | |
numStripes | |
numSSPerStripe | |
numSubStripes | |
stripeHeight | |
subStripeHeight | |
numChunks | |
numSCPerChunk | |
subChunkWidth | |
maxSCPerChunk | |
A simple partitioning scheme that breaks the unit sphere into fixed height latitude angle stripes. These are in turn broken up into fixed width longitude angle chunks (each stripe has a variable number of chunks to account for distortion at the poles). Chunks are in turn broken up into fixed height sub-stripes, and each sub-stripe is then divided into fixed width sub-chunks. Again, the number of sub-chunks per sub-stripe is variable to account for polar distortion.
def lsst.geom.geometry.SphericalBoxPartitionMap.__iter__ | ( | self | ) |
Returns an iterator over (chunkId, SubIterator) tuples - one for each chunk in the partition map. Each SubIterator is an iterator over subChunkIds for the corresponding chunk.
def lsst.geom.geometry.SphericalBoxPartitionMap.getChunk | ( | self, | |
stripe, | |||
theta | |||
) |
Returns the chunk number of the chunk containing all points in the given stripe with the given longitude angle.
def lsst.geom.geometry.SphericalBoxPartitionMap.getChunkBoundingBox | ( | self, | |
chunkId | |||
) |
Returns a SphericalBox bounding the given chunk. Note that this is a bounding box only - not an exact representation! In particular, for a point p and a chunk C with bounding box B, B.contains(p) == True does not imply that p is assigned to C. However, for all points p assigned to C, B.contains(p) is True.
def lsst.geom.geometry.SphericalBoxPartitionMap.getChunkId | ( | self, | |
stripe, | |||
chunk | |||
) |
Returns the chunk ID of the chunk with the given stripe/chunk numbers.
def lsst.geom.geometry.SphericalBoxPartitionMap.getStripe | ( | self, | |
phi | |||
) |
Returns the stripe number of the stripe containing all points with the given latitude angle.
def lsst.geom.geometry.SphericalBoxPartitionMap.getSubChunk | ( | self, | |
subStripe, | |||
theta | |||
) |
Returns the sub-chunk number of the sub-chunk containing all points in the given sub-stripe with the given longitude angle.
def lsst.geom.geometry.SphericalBoxPartitionMap.getSubChunkBoundingBox | ( | self, | |
chunkId, | |||
subChunkId | |||
) |
Returns a SphericalBox bounding the given sub-chunk. Note that this is a bounding box only - not an exact representation! In particular, for a point p and a sub-chunk SC with bounding box B, B.contains(p) == True does not imply that p is assigned to SC. However, for all points p assigned to SC, B.contains(p) is True.
def lsst.geom.geometry.SphericalBoxPartitionMap.getSubChunkId | ( | self, | |
subStripe, | |||
subChunk | |||
) |
Returns the sub-chunk ID of the sub-chunk with the given sub-stripe/sub-chunk numbers.
def lsst.geom.geometry.SphericalBoxPartitionMap.getSubStripe | ( | self, | |
phi | |||
) |
Returns the sub-stripe number of the sub-stripe containing points with the given latitude angle.
def lsst.geom.geometry.SphericalBoxPartitionMap.intersect | ( | self, | |
args | |||
) |
Computes the intersection of a spherical box partitioning of the unit sphere and one or more SphericalRegions. Results are returned as an iterator over (chunkId, SubIterator) tuples. These correspond to all chunks overlapping at least one input region, and contain sub-iterators over all sub-chunks intersecting at least one input region. The sub-iterators return (subChunkId, Regions) tuples, where Regions is a set of the regions that intersect with (but do not completely contain) a particular sub-chunk. Note that Regions can be an empty set - this means that the sub-chunk is completely contained in at least one of the input regions.