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
_convexPolygon.cc
Go to the documentation of this file.
1 /*
2  * LSST Data Management System
3  * See COPYRIGHT file at the top of the source tree.
4  *
5  * This product includes software developed by the
6  * LSST Project (http://www.lsst.org/).
7  *
8  * This program is free software: you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License as published by
10  * the Free Software Foundation, either version 3 of the License, or
11  * (at your option) any later version.
12  *
13  * This program is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the LSST License Statement and
19  * the GNU General Public License along with this program. If not,
20  * see <https://www.lsstcorp.org/LegalNotices/>.
21  */
22 #include "pybind11/pybind11.h"
23 #include "pybind11/stl.h"
24 
25 #include "lsst/sphgeom/python.h"
26 
27 #include "lsst/sphgeom/Box.h"
28 #include "lsst/sphgeom/Box3d.h"
29 #include "lsst/sphgeom/Circle.h"
31 #include "lsst/sphgeom/Ellipse.h"
33 
36 
37 namespace py = pybind11;
38 using namespace pybind11::literals;
39 
40 namespace lsst {
41 namespace sphgeom {
42 
43 namespace {
45  uint8_t const *buffer = reinterpret_cast<uint8_t const *>(
46  PYBIND11_BYTES_AS_STRING(bytes.ptr()));
47  size_t n = static_cast<size_t>(PYBIND11_BYTES_SIZE(bytes.ptr()));
48  return ConvexPolygon::decode(buffer, n);
49 }
50 }
51 
52 template <>
54  Region> &cls) {
55  cls.attr("TYPE_CODE") = py::int_(ConvexPolygon::TYPE_CODE);
56 
57  cls.def_static("convexHull", &ConvexPolygon::convexHull, "points"_a);
58 
59  cls.def(py::init<std::vector<UnitVector3d> const &>(), "points"_a);
60  // Do not wrap the two unsafe (3 and 4 vertex) constructors
61  cls.def(py::init<ConvexPolygon const &>(), "convexPolygon"_a);
62 
63  cls.def("__eq__", &ConvexPolygon::operator==, py::is_operator());
64  cls.def("__ne__", &ConvexPolygon::operator!=, py::is_operator());
65 
66  cls.def("getVertices", &ConvexPolygon::getVertices);
67  cls.def("getCentroid", &ConvexPolygon::getCentroid);
68 
69  // Note that much of the Region interface has already been wrapped. Here are bits that have not:
70  cls.def("contains", py::overload_cast<UnitVector3d const &>(&ConvexPolygon::contains, py::const_));
71  cls.def("contains", py::overload_cast<Region const &>(&ConvexPolygon::contains, py::const_));
72  cls.def("isDisjointFrom", &ConvexPolygon::isDisjointFrom);
73  cls.def("intersects", &ConvexPolygon::intersects);
74  cls.def("isWithin", &ConvexPolygon::isWithin);
75 
76  // The lambda is necessary for now; returning the unique pointer
77  // directly leads to incorrect results and crashes.
78  cls.def_static("decode",
79  [](py::bytes bytes) { return decode(bytes).release(); },
80  "bytes"_a);
81 
82  cls.def("__repr__", [](ConvexPolygon const &self) {
83  return py::str("ConvexPolygon({!r})").format(self.getVertices());
84  });
85  cls.def(py::pickle(
86  [](const ConvexPolygon &self) { return python::encode(self); },
87  [](py::bytes bytes) { return decode(bytes).release(); }));
88 }
89 
90 } // sphgeom
91 } // lsst
Ellipse.h
This file declares a class for representing elliptical regions on the unit sphere.
Box3d.h
This file declares a class for representing axis-aligned bounding boxes in ℝ³.
lsst::sphgeom::Region
Region is a minimal interface for 2-dimensional regions on the unit sphere.
Definition: Region.h:79
Box.h
This file declares a class for representing longitude/latitude angle boxes on the unit sphere.
UnitVector3d.h
This file declares a class for representing unit vectors in ℝ³.
std::vector
STL class.
python.h
Circle.h
This file declares a class for representing circular regions on the unit sphere.
lsst::afw::geom.transform.transformContinued.cls
cls
Definition: transformContinued.py:33
lsst::sphgeom::ConvexPolygon
ConvexPolygon is a closed convex polygon on the unit sphere.
Definition: ConvexPolygon.h:57
astshim.fitsChanContinued.contains
def contains(self, name)
Definition: fitsChanContinued.py:127
lsst::sphgeom::defineClass
void defineClass(py::class_< ConvexPolygon, std::unique_ptr< ConvexPolygon >, Region > &cls)
Definition: _convexPolygon.cc:53
lsst
A base class for image defects.
Definition: imageAlgorithm.dox:1
bytes
table::Key< table::Array< std::uint8_t > > bytes
Definition: Transform.cc:199
relationship.h
utils.h
pybind11
Definition: _GenericMap.cc:40
lsst::utils.tests.init
def init()
Definition: tests.py:59
std::unique_ptr
STL class.
ConvexPolygon.h
This file declares a class for representing convex polygons with great circle edges on the unit spher...