LSSTApplications  19.0.0-14-gb0260a2+72efe9b372,20.0.0+7927753e06,20.0.0+8829bf0056,20.0.0+995114c5d2,20.0.0+b6f4b2abd1,20.0.0+bddc4f4cbe,20.0.0-1-g253301a+8829bf0056,20.0.0-1-g2b7511a+0d71a2d77f,20.0.0-1-g5b95a8c+7461dd0434,20.0.0-12-g321c96ea+23efe4bbff,20.0.0-16-gfab17e72e+fdf35455f6,20.0.0-2-g0070d88+ba3ffc8f0b,20.0.0-2-g4dae9ad+ee58a624b3,20.0.0-2-g61b8584+5d3db074ba,20.0.0-2-gb780d76+d529cf1a41,20.0.0-2-ged6426c+226a441f5f,20.0.0-2-gf072044+8829bf0056,20.0.0-2-gf1f7952+ee58a624b3,20.0.0-20-geae50cf+e37fec0aee,20.0.0-25-g3dcad98+544a109665,20.0.0-25-g5eafb0f+ee58a624b3,20.0.0-27-g64178ef+f1f297b00a,20.0.0-3-g4cc78c6+e0676b0dc8,20.0.0-3-g8f21e14+4fd2c12c9a,20.0.0-3-gbd60e8c+187b78b4b8,20.0.0-3-gbecbe05+48431fa087,20.0.0-38-ge4adf513+a12e1f8e37,20.0.0-4-g97dc21a+544a109665,20.0.0-4-gb4befbc+087873070b,20.0.0-4-gf910f65+5d3db074ba,20.0.0-5-gdfe0fee+199202a608,20.0.0-5-gfbfe500+d529cf1a41,20.0.0-6-g64f541c+d529cf1a41,20.0.0-6-g9a5b7a1+a1cd37312e,20.0.0-68-ga3f3dda+5fca18c6a4,20.0.0-9-g4aef684+e18322736b,w.2020.45
LSSTDataManagementBasePackage
htmIndexer.py
Go to the documentation of this file.
1 #
2 # LSST Data Management System
3 #
4 # Copyright 2008-2017 AURA/LSST.
5 #
6 # This product includes software developed by the
7 # LSST Project (http://www.lsst.org/).
8 #
9 # This program is free software: you can redistribute it and/or modify
10 # it under the terms of the GNU General Public License as published by
11 # the Free Software Foundation, either version 3 of the License, or
12 # (at your option) any later version.
13 #
14 # This program is distributed in the hope that it will be useful,
15 # but WITHOUT ANY WARRANTY; without even the implied warranty of
16 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 # GNU General Public License for more details.
18 #
19 # You should have received a copy of the LSST License Statement and
20 # the GNU General Public License along with this program. If not,
21 # see <https://www.lsstcorp.org/LegalNotices/>.
22 #
23 import esutil
24 
25 
26 class HtmIndexer:
27  """Manage a spatial index of hierarchical triangular mesh (HTM)
28  shards.
29 
30  Parameters
31  ----------
32  depth : `int`
33  Depth of the HTM hierarchy to construct.
34  """
35  def __init__(self, depth=8):
36  self.htm = esutil.htm.HTM(depth)
37 
38  def getShardIds(self, ctrCoord, radius):
39  """Get the IDs of all shards that touch a circular aperture.
40 
41  Parameters
42  ----------
43  ctrCoord : `lsst.geom.SpherePoint`
44  ICRS center of search region.
45  radius : `lsst.geom.Angle`
46  Radius of search region.
47 
48  Returns
49  -------
50  results : `tuple`
51  A tuple containing:
52 
53  - shardIdList : `list` of `int`
54  List of shard IDs
55  - isOnBoundary : `list` of `bool`
56  For each shard in ``shardIdList`` is the shard on the
57  boundary (not fully enclosed by the search region)?
58  """
59  shardIdList = self.htm.intersect(ctrCoord.getLongitude().asDegrees(),
60  ctrCoord.getLatitude().asDegrees(),
61  radius.asDegrees(), inclusive=True)
62  coveredShardIdList = self.htm.intersect(ctrCoord.getLongitude().asDegrees(),
63  ctrCoord.getLatitude().asDegrees(),
64  radius.asDegrees(), inclusive=False)
65  isOnBoundary = (shardId not in coveredShardIdList for shardId in shardIdList)
66  return shardIdList, isOnBoundary
67 
68  def indexPoints(self, raList, decList):
69  """Generate shard IDs for sky positions.
70 
71  Parameters
72  ----------
73  raList : `list` of `float`
74  List of right ascensions, in degrees.
75  decList : `list` of `float`
76  List of declinations, in degrees.
77 
78  Returns
79  -------
80  shardIds : `list` of `int`
81  List of shard IDs
82  """
83  return self.htm.lookup_id(raList, decList)
84 
85  @staticmethod
86  def makeDataId(shardId, datasetName):
87  """Make a data id from a shard ID.
88 
89  Parameters
90  ----------
91  shardId : `int`
92  ID of shard in question.
93  datasetName : `str`
94  Name of dataset to use.
95 
96  Returns
97  -------
98  dataId : `dict`
99  Data ID for shard.
100  """
101  if shardId is None:
102  # NoneType doesn't format, so make dummy pixel
103  shardId = 0
104  return {'pixel_id': shardId, 'name': datasetName}
lsst::meas::algorithms.htmIndexer.HtmIndexer.htm
htm
Definition: htmIndexer.py:36
lsst::meas::algorithms.htmIndexer.HtmIndexer.indexPoints
def indexPoints(self, raList, decList)
Definition: htmIndexer.py:68
lsst::meas::algorithms.htmIndexer.HtmIndexer.makeDataId
def makeDataId(shardId, datasetName)
Definition: htmIndexer.py:86
lsst::meas::algorithms.htmIndexer.HtmIndexer.__init__
def __init__(self, depth=8)
Definition: htmIndexer.py:35
lsst::meas::algorithms.htmIndexer.HtmIndexer.getShardIds
def getShardIds(self, ctrCoord, radius)
Definition: htmIndexer.py:38
lsst::meas::algorithms.htmIndexer.HtmIndexer
Definition: htmIndexer.py:26