LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
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 
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
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
void defineClass(py::class_< ConvexPolygon, std::unique_ptr< ConvexPolygon >, Region > &cls)
def init()
Definition: tests.py:59
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.