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
_box3d.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 
24 #include "lsst/sphgeom/python.h"
25 
26 #include "lsst/sphgeom/Box3d.h"
29 
30 namespace py = pybind11;
31 using namespace pybind11::literals;
32 
33 namespace lsst {
34 namespace sphgeom {
35 
36 template <>
37 void defineClass(py::class_<Box3d, std::shared_ptr<Box3d>> &cls) {
38  cls.def_static("empty", &Box3d::empty);
39  cls.def_static("full", &Box3d::full);
40  cls.def_static("aroundUnitSphere", &Box3d::aroundUnitSphere);
41 
42  cls.def(py::init<>());
43  cls.def(py::init<Vector3d const &>(), "vector"_a);
44  cls.def(py::init<Vector3d const &, Vector3d const &>(), "vector1"_a,
45  "vector2"_a);
46  cls.def(py::init<Vector3d const &, double, double, double>(), "center"_a,
47  "halfWidth"_a, "halfHeight"_a, "halfDepth"_a);
48  cls.def(py::init<Interval1d const &, Interval1d const &,
49  Interval1d const &>(),
50  "x"_a, "y"_a, "z"_a);
51  cls.def(py::init<Box3d const &>(), "box3d"_a);
52 
53  cls.def("__eq__",
54  (bool (Box3d::*)(Box3d const &) const) & Box3d::operator==,
55  py::is_operator());
56  cls.def("__eq__",
57  (bool (Box3d::*)(Vector3d const &) const) & Box3d::operator==,
58  py::is_operator());
59  cls.def("__ne__",
60  (bool (Box3d::*)(Box3d const &) const) & Box3d::operator!=,
61  py::is_operator());
62  cls.def("__ne__",
63  (bool (Box3d::*)(Vector3d const &) const) & Box3d::operator!=,
64  py::is_operator());
65  cls.def("__contains__",
66  (bool (Box3d::*)(Vector3d const &) const) & Box3d::contains,
67  py::is_operator());
68  cls.def("__contains__",
69  (bool (Box3d::*)(Box3d const &) const) & Box3d::contains,
70  py::is_operator());
71  cls.def("__len__", [](Box3d const &self) { return py::int_(3); });
72  cls.def("__getitem__", [](Box3d const &self, py::int_ row) {
73  return self(static_cast<int>(python::convertIndex(3, row)));
74  });
75 
76  cls.def("x", &Box3d::x);
77  cls.def("y", &Box3d::y);
78  cls.def("z", &Box3d::z);
79  cls.def("isEmpty", &Box3d::isEmpty);
80  cls.def("isFull", &Box3d::isFull);
81  cls.def("getCenter", &Box3d::getCenter);
82  cls.def("getWidth", &Box3d::getWidth);
83  cls.def("getHeight", &Box3d::getHeight);
84  cls.def("getDepth", &Box3d::getDepth);
85 
86  cls.def("contains",
87  (bool (Box3d::*)(Vector3d const &) const) & Box3d::contains);
88  cls.def("contains",
89  (bool (Box3d::*)(Box3d const &) const) & Box3d::contains);
90  cls.def("isDisjointFrom",
91  (bool (Box3d::*)(Vector3d const &) const) & Box3d::isDisjointFrom);
92  cls.def("isDisjointFrom",
93  (bool (Box3d::*)(Box3d const &) const) & Box3d::isDisjointFrom);
94  cls.def("intersects",
95  (bool (Box3d::*)(Vector3d const &) const) & Box3d::intersects);
96  cls.def("intersects",
97  (bool (Box3d::*)(Box3d const &) const) & Box3d::intersects);
98  cls.def("isWithin",
99  (bool (Box3d::*)(Vector3d const &) const) & Box3d::isWithin);
100  cls.def("isWithin",
101  (bool (Box3d::*)(Box3d const &) const) & Box3d::isWithin);
102 
103  cls.def("clipTo", (Box3d & (Box3d::*)(Vector3d const &)) & Box3d::clipTo);
104  cls.def("clipTo", (Box3d & (Box3d::*)(Box3d const &)) & Box3d::clipTo);
105  cls.def("clippedTo",
106  (Box3d(Box3d::*)(Vector3d const &) const) & Box3d::clippedTo);
107  cls.def("clippedTo",
108  (Box3d(Box3d::*)(Box3d const &) const) & Box3d::clippedTo);
109  cls.def("expandTo",
110  (Box3d & (Box3d::*)(Vector3d const &)) & Box3d::expandTo);
111  cls.def("expandTo", (Box3d & (Box3d::*)(Box3d const &)) & Box3d::expandTo);
112  cls.def("expandedTo",
113  (Box3d(Box3d::*)(Vector3d const &) const) & Box3d::expandedTo);
114  cls.def("expandedTo",
115  (Box3d(Box3d::*)(Box3d const &) const) & Box3d::expandedTo);
116 
117  cls.def("dilateBy", (Box3d & (Box3d::*)(double)) & Box3d::dilateBy,
118  "radius"_a);
119  cls.def("dilateBy",
120  (Box3d & (Box3d::*)(double, double, double)) & Box3d::dilateBy,
121  "width"_a, "height"_a, "depth"_a);
122  cls.def("dilatedBy", (Box3d(Box3d::*)(double) const) & Box3d::dilatedBy,
123  "radius"_a);
124  cls.def("dilatedBy",
125  (Box3d(Box3d::*)(double, double, double) const) & Box3d::dilatedBy,
126  "width"_a, "height"_a, "depth"_a);
127  cls.def("erodeBy", (Box3d & (Box3d::*)(double)) & Box3d::erodeBy,
128  "radius"_a);
129  cls.def("erodeBy",
130  (Box3d & (Box3d::*)(double, double, double)) & Box3d::erodeBy,
131  "width"_a, "height"_a, "depth"_a);
132  cls.def("erodedBy", (Box3d(Box3d::*)(double) const) & Box3d::erodedBy,
133  "radius"_a);
134  cls.def("erodedBy",
135  (Box3d(Box3d::*)(double, double, double) const) & Box3d::erodedBy,
136  "width"_a, "height"_a, "depth"_a);
137 
138  cls.def("relate",
139  (Relationship(Box3d::*)(Vector3d const &) const) & Box3d::relate);
140  cls.def("relate",
141  (Relationship(Box3d::*)(Box3d const &) const) & Box3d::relate);
142 
143  cls.def("__str__", [](Box3d const &self) {
144  return py::str("[{!s},\n"
145  " {!s},\n"
146  " {!s}]")
147  .format(self.x(), self.y(), self.z());
148  });
149  cls.def("__repr__", [](Box3d const &self) {
150  return py::str("Box3d({!r},\n"
151  " {!r},\n"
152  " {!r})")
153  .format(self.x(), self.y(), self.z());
154  });
155  cls.def("__reduce__", [cls](Box3d const &self) {
156  return py::make_tuple(cls,
157  py::make_tuple(self.x(), self.y(), self.z()));
158  });
159 }
160 
161 } // sphgeom
162 } // lsst
This file declares a class for representing axis-aligned bounding boxes in ℝ³.
double x
double z
Definition: Match.cc:44
int y
Definition: SpanSet.cc:49
Box3d represents a box in ℝ³.
Definition: Box3d.h:42
Interval1d represents closed intervals of ℝ.
Definition: Interval1d.h:39
Vector3d is a vector in ℝ³ with components stored in double precision.
Definition: Vector3d.h:44
Relationship relate(VertexIterator const begin, VertexIterator const end, Box const &b)
std::bitset< 3 > Relationship
Relationship describes how two sets are related.
Definition: Relationship.h:35
void defineClass(py::class_< Box3d, std::shared_ptr< Box3d >> &cls)
Definition: _box3d.cc:37
def init()
Definition: tests.py:59
A base class for image defects.
int row
Definition: CR.cc:145