23#ifndef LSST_SPHGEOM_CONVEXPOLYGON_H_
24#define LSST_SPHGEOM_CONVEXPOLYGON_H_
59 static constexpr uint8_t TYPE_CODE =
'p';
71 explicit ConvexPolygon(std::vector<UnitVector3d>
const & points);
92 _vertices{v0, v1, v2, v3}
97 bool operator!=(
ConvexPolygon const & p)
const {
return !(*
this == p); }
99 std::vector<UnitVector3d>
const & getVertices()
const {
108 std::unique_ptr<Region>
clone()
const override {
109 return std::unique_ptr<ConvexPolygon>(
new ConvexPolygon(*
this));
153 std::vector<uint8_t>
encode()
const override;
157 static std::unique_ptr<ConvexPolygon>
decode(std::vector<uint8_t>
const & s) {
158 return decode(s.data(), s.size());
160 static std::unique_ptr<ConvexPolygon>
decode(uint8_t
const * buffer,
size_t n);
164 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
168 std::vector<UnitVector3d> _vertices;
171std::ostream & operator<<(std::ostream &, ConvexPolygon
const &);
This file defines an interface for spherical regions.
std::bitset< 3 > Relationship
Relationship describes how two sets are related.
Definition: Relationship.h:35
Relationship invert(Relationship r)
Definition: Relationship.h:55
This file declares a class for representing unit vectors in ℝ³.
Definition: ConvexPolygon.h:57
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2, UnitVector3d const &v3)
Definition: ConvexPolygon.h:88
Box3d getBoundingBox3d() const override
getBoundingBox3d returns a 3-dimensional bounding-box for this region.
Definition: ConvexPolygon.cc:308
bool intersects(Region const &r) const
Definition: ConvexPolygon.cc:324
UnitVector3d getCentroid() const
Definition: ConvexPolygon.cc:296
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2)
Definition: ConvexPolygon.h:77
bool contains(UnitVector3d const &v) const override
Definition: ConvexPolygon.cc:312
bool isDisjointFrom(Region const &r) const
Definition: ConvexPolygon.cc:320
static ConvexPolygon convexHull(std::vector< UnitVector3d > const &points)
Definition: ConvexPolygon.h:65
Relationship relate(Region const &r) const override
Definition: ConvexPolygon.h:143
Circle getBoundingCircle() const override
getBoundingCircle returns a bounding-circle for this region.
Definition: ConvexPolygon.cc:300
std::vector< uint8_t > encode() const override
Definition: ConvexPolygon.cc:348
Box getBoundingBox() const override
getBoundingBox returns a bounding-box for this region.
Definition: ConvexPolygon.cc:304
static std::unique_ptr< ConvexPolygon > decode(std::vector< uint8_t > const &s)
Definition: ConvexPolygon.h:157
std::unique_ptr< Region > clone() const override
clone returns a deep copy of this region.
Definition: ConvexPolygon.h:108
bool operator==(ConvexPolygon const &p) const
Two convex polygons are equal iff they contain the same points.
Definition: ConvexPolygon.cc:261
bool isWithin(Region const &r) const
Definition: ConvexPolygon.cc:328
Definition: Ellipse.h:170
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.
Definition: UnitVector3d.h:55