LSST Applications g0f08755f38+82efc23009,g12f32b3c4e+e7bdf1200e,g1653933729+a8ce1bb630,g1a0ca8cf93+50eff2b06f,g28da252d5a+52db39f6a5,g2bbee38e9b+37c5a29d61,g2bc492864f+37c5a29d61,g2cdde0e794+c05ff076ad,g3156d2b45e+41e33cbcdc,g347aa1857d+37c5a29d61,g35bb328faa+a8ce1bb630,g3a166c0a6a+37c5a29d61,g3e281a1b8c+fb992f5633,g414038480c+7f03dfc1b0,g41af890bb2+11b950c980,g5fbc88fb19+17cd334064,g6b1c1869cb+12dd639c9a,g781aacb6e4+a8ce1bb630,g80478fca09+72e9651da0,g82479be7b0+04c31367b4,g858d7b2824+82efc23009,g9125e01d80+a8ce1bb630,g9726552aa6+8047e3811d,ga5288a1d22+e532dc0a0b,gae0086650b+a8ce1bb630,gb58c049af0+d64f4d3760,gc28159a63d+37c5a29d61,gcf0d15dbbd+2acd6d4d48,gd7358e8bfb+778a810b6e,gda3e153d99+82efc23009,gda6a2b7d83+2acd6d4d48,gdaeeff99f8+1711a396fd,ge2409df99d+6b12de1076,ge79ae78c31+37c5a29d61,gf0baf85859+d0a5978c5a,gf3967379c6+4954f8c433,gfb92a5be7c+82efc23009,gfec2e1e490+2aaed99252,w.2024.46
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#include <cstdint>
40
41#include "Region.h"
42#include "UnitVector3d.h"
43
44
45namespace lsst {
46namespace sphgeom {
47
65class ConvexPolygon : public Region {
66public:
67 static constexpr std::uint8_t TYPE_CODE = 'p';
68
74 return ConvexPolygon(points);
75 }
76
79 explicit ConvexPolygon(std::vector<UnitVector3d> const & points);
80
86 UnitVector3d const & v1,
87 UnitVector3d const & v2) :
88 _vertices{v0, v1, v2}
89 {}
90
97 UnitVector3d const & v1,
98 UnitVector3d const & v2,
99 UnitVector3d const & v3) :
100 _vertices{v0, v1, v2, v3}
101 {}
102
104 bool operator==(ConvexPolygon const & p) const;
105 bool operator!=(ConvexPolygon const & p) const { return !(*this == p); }
106
108 return _vertices;
109 }
110
114
115 // Region interface
118 }
119
120 Box getBoundingBox() const override;
121 Box3d getBoundingBox3d() const override;
122 Circle getBoundingCircle() const override;
123
127 bool contains(UnitVector3d const & v) const override;
128 bool contains(Region const & r) const;
130
131 using Region::contains;
132
136 bool isDisjointFrom(Region const & r) const;
138
142 bool intersects(Region const & r) const;
144
148 bool isWithin(Region const & r) const;
150
151 Relationship relate(Region const & r) const override {
152 // Dispatch on the type of r.
153 return invert(r.relate(*this));
154 }
155
156 Relationship relate(Box const &) const override;
157 Relationship relate(Circle const &) const override;
158 Relationship relate(ConvexPolygon const &) const override;
159 Relationship relate(Ellipse const &) const override;
160
161 std::vector<std::uint8_t> encode() const override;
162
166 return decode(s.data(), s.size());
167 }
168 static std::unique_ptr<ConvexPolygon> decode(std::uint8_t const * buffer, size_t n);
170
171private:
172 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
173
174 ConvexPolygon() : _vertices() {}
175
177};
178
179std::ostream & operator<<(std::ostream &, ConvexPolygon const &);
180
181}} // namespace lsst::sphgeom
182
183#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:62
Circle is a circular region on the unit sphere that contains its boundary.
Definition Circle.h:54
ConvexPolygon is a closed convex polygon on the unit sphere.
bool operator!=(ConvexPolygon const &p) const
static constexpr std::uint8_t TYPE_CODE
static std::unique_ptr< ConvexPolygon > decode(std::vector< std::uint8_t > const &s)
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.
std::vector< std::uint8_t > encode() const override
encode serializes this region into an opaque byte string.
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.
Box getBoundingBox() const override
getBoundingBox returns a bounding-box for this region.
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:87
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.