LSST Applications g180d380827+0f66a164bb,g2079a07aa2+86d27d4dc4,g2305ad1205+7d304bc7a0,g29320951ab+500695df56,g2bbee38e9b+0e5473021a,g337abbeb29+0e5473021a,g33d1c0ed96+0e5473021a,g3a166c0a6a+0e5473021a,g3ddfee87b4+e42ea45bea,g48712c4677+36a86eeaa5,g487adcacf7+2dd8f347ac,g50ff169b8f+96c6868917,g52b1c1532d+585e252eca,g591dd9f2cf+c70619cc9d,g5a732f18d5+53520f316c,g5ea96fc03c+341ea1ce94,g64a986408d+f7cd9c7162,g858d7b2824+f7cd9c7162,g8a8a8dda67+585e252eca,g99cad8db69+469ab8c039,g9ddcbc5298+9a081db1e4,ga1e77700b3+15fc3df1f7,gb0e22166c9+60f28cb32d,gba4ed39666+c2a2e4ac27,gbb8dafda3b+c92fc63c7e,gbd866b1f37+f7cd9c7162,gc120e1dc64+02c66aa596,gc28159a63d+0e5473021a,gc3e9b769f7+b0068a2d9f,gcf0d15dbbd+e42ea45bea,gdaeeff99f8+f9a426f77a,ge6526c86ff+84383d05b3,ge79ae78c31+0e5473021a,gee10cc3b42+585e252eca,gff1a9f87cc+f7cd9c7162,w.2024.17
LSST Data Management Base Package
Loading...
Searching...
No Matches
ConvexPolygon.h
Go to the documentation of this file.
1/*
2 * This file is part of sphgeom.
3 *
4 * Developed for the LSST Data Management System.
5 * This product includes software developed by the LSST Project
6 * (http://www.lsst.org).
7 * See the COPYRIGHT file at the top-level directory of this distribution
8 * for details of code ownership.
9 *
10 * This software is dual licensed under the GNU General Public License and also
11 * under a 3-clause BSD license. Recipients may choose which of these licenses
12 * to use; please see the files gpl-3.0.txt and/or bsd_license.txt,
13 * respectively. If you choose the GPL option then the following text applies
14 * (but note that there is still no warranty even if you opt for BSD instead):
15 *
16 * This program is free software: you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation, either version 3 of the License, or
19 * (at your option) any later version.
20 *
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 * GNU General Public License for more details.
25 *
26 * You should have received a copy of the GNU General Public License
27 * along with this program. If not, see <http://www.gnu.org/licenses/>.
28 */
29
30#ifndef LSST_SPHGEOM_CONVEXPOLYGON_H_
31#define LSST_SPHGEOM_CONVEXPOLYGON_H_
32
36
37#include <iosfwd>
38#include <vector>
39
40#include "Region.h"
41#include "UnitVector3d.h"
42
43
44namespace lsst {
45namespace sphgeom {
46
64class ConvexPolygon : public Region {
65public:
66 static constexpr uint8_t TYPE_CODE = 'p';
67
73 return ConvexPolygon(points);
74 }
75
78 explicit ConvexPolygon(std::vector<UnitVector3d> const & points);
79
85 UnitVector3d const & v1,
86 UnitVector3d const & v2) :
87 _vertices{v0, v1, v2}
88 {}
89
96 UnitVector3d const & v1,
97 UnitVector3d const & v2,
98 UnitVector3d const & v3) :
99 _vertices{v0, v1, v2, v3}
100 {}
101
103 bool operator==(ConvexPolygon const & p) const;
104 bool operator!=(ConvexPolygon const & p) const { return !(*this == p); }
105
107 return _vertices;
108 }
109
113
114 // Region interface
117 }
118
119 Box getBoundingBox() const override;
120 Box3d getBoundingBox3d() const override;
121 Circle getBoundingCircle() const override;
122
126 bool contains(UnitVector3d const & v) const override;
127 bool contains(Region const & r) const;
129
130 using Region::contains;
131
135 bool isDisjointFrom(Region const & r) const;
137
141 bool intersects(Region const & r) const;
143
147 bool isWithin(Region const & r) const;
149
150 Relationship relate(Region const & r) const override {
151 // Dispatch on the type of r.
152 return invert(r.relate(*this));
153 }
154
155 Relationship relate(Box const &) const override;
156 Relationship relate(Circle const &) const override;
157 Relationship relate(ConvexPolygon const &) const override;
158 Relationship relate(Ellipse const &) const override;
159
160 std::vector<uint8_t> encode() const override;
161
165 return decode(s.data(), s.size());
166 }
167 static std::unique_ptr<ConvexPolygon> decode(uint8_t const * buffer, size_t n);
169
170private:
171 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
172
173 ConvexPolygon() : _vertices() {}
174
176};
177
178std::ostream & operator<<(std::ostream &, ConvexPolygon const &);
179
180}} // namespace lsst::sphgeom
181
182#endif // LSST_SPHGEOM_CONVEXPOLYGON_H_
This file defines an interface for spherical regions.
This file declares a class for representing unit vectors in ℝ³.
Box3d represents a box in ℝ³.
Definition Box3d.h:49
Box represents a rectangle in spherical coordinate space that contains its boundary.
Definition Box.h:61
Circle is a circular region on the unit sphere that contains its boundary.
Definition Circle.h:53
ConvexPolygon is a closed convex polygon on the unit sphere.
bool operator!=(ConvexPolygon const &p) const
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2, UnitVector3d const &v3)
This constructor creates a quadrilateral with the given vertices.
Box3d getBoundingBox3d() const override
getBoundingBox3d returns a 3-dimensional bounding-box for this region.
bool intersects(Region const &r) const
UnitVector3d getCentroid() const
The centroid of a polygon is its center of mass projected onto S², assuming a uniform mass distributi...
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2)
This constructor creates a triangle with the given vertices.
bool contains(UnitVector3d const &v) const override
bool isDisjointFrom(Region const &r) const
static ConvexPolygon convexHull(std::vector< UnitVector3d > const &points)
convexHull returns the convex hull of the given set of points if it exists and throws an exception ot...
Relationship relate(Region const &r) const override
Circle getBoundingCircle() const override
getBoundingCircle returns a bounding-circle for this region.
std::vector< uint8_t > encode() const override
encode serializes this region into an opaque byte string.
static constexpr uint8_t TYPE_CODE
Box getBoundingBox() const override
getBoundingBox returns a bounding-box for this region.
static std::unique_ptr< ConvexPolygon > decode(std::vector< uint8_t > const &s)
std::unique_ptr< Region > clone() const override
clone returns a deep copy of this region.
bool operator==(ConvexPolygon const &p) const
Two convex polygons are equal iff they contain the same points.
std::vector< UnitVector3d > const & getVertices() const
bool isWithin(Region const &r) const
Ellipse is an elliptical region on the sphere.
Definition Ellipse.h:177
Region is a minimal interface for 2-dimensional regions on the unit sphere.
Definition Region.h:86
virtual Relationship relate(Region const &) const =0
virtual bool contains(UnitVector3d const &) const =0
contains tests whether the given unit vector is inside this region.
UnitVector3d is a unit vector in ℝ³ with components stored in double precision.
std::ostream & operator<<(std::ostream &, Angle const &)
Definition Angle.cc:41
Relationship invert(Relationship r)
Given the relationship between two sets A and B (i.e.