LSST Applications  21.0.0-147-g0e635eb1+1acddb5be5,22.0.0+052faf71bd,22.0.0+1ea9a8b2b2,22.0.0+6312710a6c,22.0.0+729191ecac,22.0.0+7589c3a021,22.0.0+9f079a9461,22.0.1-1-g7d6de66+b8044ec9de,22.0.1-1-g87000a6+536b1ee016,22.0.1-1-g8e32f31+6312710a6c,22.0.1-10-gd060f87+016f7cdc03,22.0.1-12-g9c3108e+df145f6f68,22.0.1-16-g314fa6d+c825727ab8,22.0.1-19-g93a5c75+d23f2fb6d8,22.0.1-19-gb93eaa13+aab3ef7709,22.0.1-2-g8ef0a89+b8044ec9de,22.0.1-2-g92698f7+9f079a9461,22.0.1-2-ga9b0f51+052faf71bd,22.0.1-2-gac51dbf+052faf71bd,22.0.1-2-gb66926d+6312710a6c,22.0.1-2-gcb770ba+09e3807989,22.0.1-20-g32debb5+b8044ec9de,22.0.1-23-gc2439a9a+fb0756638e,22.0.1-3-g496fd5d+09117f784f,22.0.1-3-g59f966b+1e6ba2c031,22.0.1-3-g849a1b8+f8b568069f,22.0.1-3-gaaec9c0+c5c846a8b1,22.0.1-32-g5ddfab5d3+60ce4897b0,22.0.1-4-g037fbe1+64e601228d,22.0.1-4-g8623105+b8044ec9de,22.0.1-5-g096abc9+d18c45d440,22.0.1-5-g15c806e+57f5c03693,22.0.1-7-gba73697+57f5c03693,master-g6e05de7fdc+c1283a92b8,master-g72cdda8301+729191ecac,w.2021.39
LSST Data Management Base Package
_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 #include "pybind11/numpy.h"
25 
26 #include "lsst/sphgeom/python.h"
27 
28 #include "lsst/sphgeom/Box.h"
29 #include "lsst/sphgeom/Box3d.h"
30 #include "lsst/sphgeom/Circle.h"
32 #include "lsst/sphgeom/Ellipse.h"
34 
37 
38 namespace py = pybind11;
39 using namespace pybind11::literals;
40 
41 namespace lsst {
42 namespace sphgeom {
43 
44 namespace {
46  uint8_t const *buffer = reinterpret_cast<uint8_t const *>(
47  PYBIND11_BYTES_AS_STRING(bytes.ptr()));
48  size_t n = static_cast<size_t>(PYBIND11_BYTES_SIZE(bytes.ptr()));
49  return ConvexPolygon::decode(buffer, n);
50 }
51 }
52 
53 template <>
55  Region> &cls) {
56  cls.attr("TYPE_CODE") = py::int_(ConvexPolygon::TYPE_CODE);
57 
58  cls.def_static("convexHull", &ConvexPolygon::convexHull, "points"_a);
59 
60  cls.def(py::init<std::vector<UnitVector3d> const &>(), "points"_a);
61  // Do not wrap the two unsafe (3 and 4 vertex) constructors
62  cls.def(py::init<ConvexPolygon const &>(), "convexPolygon"_a);
63 
64  cls.def("__eq__", &ConvexPolygon::operator==, py::is_operator());
65  cls.def("__ne__", &ConvexPolygon::operator!=, py::is_operator());
66 
67  cls.def("getVertices", &ConvexPolygon::getVertices);
68  cls.def("getCentroid", &ConvexPolygon::getCentroid);
69 
70  // Note that much of the Region interface has already been wrapped. Here are bits that have not:
71  // (include overloads from Region that would otherwise be shadowed).
72  cls.def("contains", py::overload_cast<UnitVector3d const &>(&ConvexPolygon::contains, py::const_));
73  cls.def("contains", py::overload_cast<Region const &>(&ConvexPolygon::contains, py::const_));
74  cls.def("contains",
75  py::vectorize((bool (ConvexPolygon::*)(double, double, double) const)&ConvexPolygon::contains),
76  "x"_a, "y"_a, "z"_a);
77  cls.def("contains",
78  py::vectorize((bool (ConvexPolygon::*)(double, double) const)&ConvexPolygon::contains),
79  "lon"_a, "lat"_a);
80  cls.def("isDisjointFrom", &ConvexPolygon::isDisjointFrom);
81  cls.def("intersects", &ConvexPolygon::intersects);
82  cls.def("isWithin", &ConvexPolygon::isWithin);
83 
84  // The lambda is necessary for now; returning the unique pointer
85  // directly leads to incorrect results and crashes.
86  cls.def_static("decode",
87  [](py::bytes bytes) { return decode(bytes).release(); },
88  "bytes"_a);
89 
90  cls.def("__repr__", [](ConvexPolygon const &self) {
91  return py::str("ConvexPolygon({!r})").format(self.getVertices());
92  });
93  cls.def(py::pickle(
94  [](const ConvexPolygon &self) { return python::encode(self); },
95  [](py::bytes bytes) { return decode(bytes).release(); }));
96 }
97 
98 } // sphgeom
99 } // lsst
This file declares a class for representing axis-aligned bounding boxes in ℝ³.
This file declares a class for representing circular regions on the unit sphere.
This file declares a class for representing convex polygons with great circle edges on the unit spher...
This file declares a class for representing unit vectors in ℝ³.
table::Key< table::Array< std::uint8_t > > bytes
Definition: python.h:135
ConvexPolygon is a closed convex polygon on the unit sphere.
Definition: ConvexPolygon.h:57
Region is a minimal interface for 2-dimensional regions on the unit sphere.
Definition: Region.h:79
pybind11::bytes encode(Region const &self)
Encode a Region as a pybind11 bytes object.
Definition: utils.h:53
void defineClass(py::class_< ConvexPolygon, std::unique_ptr< ConvexPolygon >, Region > &cls)
A base class for image defects.
This file declares a class for representing longitude/latitude angle boxes on the unit sphere.
This file declares a class for representing elliptical regions on the unit sphere.