LSST Applications  21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
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.