lsst.sphgeom g31e44d4a5c+b0138be388
 
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
73 static ConvexPolygon convexHull(std::vector<UnitVector3d> const & points) {
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
107 std::vector<UnitVector3d> const & getVertices() const {
108 return _vertices;
109 }
110
113 UnitVector3d getCentroid() const;
114
115 // Region interface
116 std::unique_ptr<Region> clone() const override {
117 return std::unique_ptr<ConvexPolygon>(new ConvexPolygon(*this));
118 }
119
120 bool isEmpty() const override;
121
122 Box getBoundingBox() const override;
123 Box3d getBoundingBox3d() const override;
124 Circle getBoundingCircle() const override;
125
129 bool contains(UnitVector3d const & v) const override;
130 bool contains(Region const & r) const;
132
133 using Region::contains;
134
138 bool isDisjointFrom(Region const & r) const;
140
144 bool intersects(Region const & r) const;
146
150 bool isWithin(Region const & r) const;
152
153 Relationship relate(Region const & r) const override {
154 // Dispatch on the type of r.
155 return invert(r.relate(*this));
156 }
157
158 Relationship relate(Box const &) const override;
159 Relationship relate(Circle const &) const override;
160 Relationship relate(ConvexPolygon const &) const override;
161 Relationship relate(Ellipse const &) const override;
162
163 TriState overlaps(Region const& other) const override {
164 return other.overlaps(*this);
165 }
166 TriState overlaps(Box const &) const override;
167 TriState overlaps(Circle const &) const override;
168 TriState overlaps(ConvexPolygon const &) const override;
169 TriState overlaps(Ellipse const &) const override;
170
171 std::vector<std::uint8_t> encode() const override;
172
175 static std::unique_ptr<ConvexPolygon> decode(std::vector<std::uint8_t> const & s) {
176 return decode(s.data(), s.size());
177 }
178 static std::unique_ptr<ConvexPolygon> decode(std::uint8_t const * buffer, size_t n);
180
181private:
182 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
183
184 ConvexPolygon() : _vertices() {}
185
186 std::vector<UnitVector3d> _vertices;
187};
188
189std::ostream & operator<<(std::ostream &, ConvexPolygon const &);
190
191}} // namespace lsst::sphgeom
192
193#endif // LSST_SPHGEOM_CONVEXPOLYGON_H_
This file defines an interface for spherical regions.
This file declares a class for representing unit vectors in ℝ³.
Definition Box3d.h:49
Definition Box.h:62
Definition Circle.h:54
Definition ConvexPolygon.h:65
static std::unique_ptr< ConvexPolygon > decode(std::vector< std::uint8_t > const &s)
Definition ConvexPolygon.h:175
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2, UnitVector3d const &v3)
Definition ConvexPolygon.h:96
Box3d getBoundingBox3d() const override
getBoundingBox3d returns a 3-dimensional bounding-box for this region.
Definition ConvexPolygon.cc:320
std::vector< std::uint8_t > encode() const override
Definition ConvexPolygon.cc:380
bool intersects(Region const &r) const
Definition ConvexPolygon.cc:336
UnitVector3d getCentroid() const
Definition ConvexPolygon.cc:308
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2)
Definition ConvexPolygon.h:85
bool contains(UnitVector3d const &v) const override
Definition ConvexPolygon.cc:324
TriState overlaps(Region const &other) const override
Definition ConvexPolygon.h:163
bool isDisjointFrom(Region const &r) const
Definition ConvexPolygon.cc:332
static ConvexPolygon convexHull(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.h:73
Relationship relate(Region const &r) const override
Definition ConvexPolygon.h:153
Circle getBoundingCircle() const override
getBoundingCircle returns a bounding-circle for this region.
Definition ConvexPolygon.cc:312
ConvexPolygon(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.cc:262
Box getBoundingBox() const override
getBoundingBox returns a bounding-box for this region.
Definition ConvexPolygon.cc:316
std::unique_ptr< Region > clone() const override
clone returns a deep copy of this region.
Definition ConvexPolygon.h:116
bool isEmpty() const override
isEmpty returns true when a region does not contain any points.
Definition ConvexPolygon.cc:303
bool operator==(ConvexPolygon const &p) const
Two convex polygons are equal iff they contain the same points.
Definition ConvexPolygon.cc:268
bool isWithin(Region const &r) const
Definition ConvexPolygon.cc:340
Definition Ellipse.h:177
Definition Region.h:89
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.
virtual TriState overlaps(Region const &other) const =0
Definition Region.cc:59
Definition TriState.h:46
Definition UnitVector3d.h:62
Definition Angle.h:45
Relationship invert(Relationship r)
Definition Relationship.h:62
std::bitset< 3 > Relationship
Relationship describes how two sets are related.
Definition Relationship.h:42