30#ifndef LSST_SPHGEOM_CONVEXPOLYGON_H_
31#define LSST_SPHGEOM_CONVEXPOLYGON_H_
67 static constexpr std::uint8_t TYPE_CODE =
'p';
79 explicit ConvexPolygon(std::vector<UnitVector3d>
const & points);
100 _vertices{v0, v1, v2, v3}
105 bool operator!=(
ConvexPolygon const & p)
const {
return !(*
this == p); }
107 std::vector<UnitVector3d>
const & getVertices()
const {
116 std::unique_ptr<Region>
clone()
const override {
117 return std::unique_ptr<ConvexPolygon>(
new ConvexPolygon(*
this));
170 std::vector<std::uint8_t>
encode()
const override;
174 static std::unique_ptr<ConvexPolygon>
decode(std::vector<std::uint8_t>
const & s) {
175 return decode(s.data(), s.size());
177 static std::unique_ptr<ConvexPolygon>
decode(std::uint8_t
const * buffer,
size_t n);
181 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
189 std::string toIvoaStcsBody(std::string
const & frame =
"")
const override;
191 std::vector<UnitVector3d> _vertices;
194std::ostream & operator<<(std::ostream &, ConvexPolygon
const &);
This file defines an interface for spherical regions.
This file declares a class for representing unit vectors in ℝ³.
Definition ConvexPolygon.h:65
static std::unique_ptr< ConvexPolygon > decode(std::vector< std::uint8_t > const &s)
Definition ConvexPolygon.h:174
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:344
std::vector< std::uint8_t > encode() const override
Definition ConvexPolygon.cc:400
bool intersects(Region const &r) const
Definition ConvexPolygon.cc:356
UnitVector3d getCentroid() const
Definition ConvexPolygon.cc:310
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2)
Definition ConvexPolygon.h:85
bool contains(UnitVector3d const &v) const override
Definition ConvexPolygon.cc:348
TriState overlaps(Region const &other) const override
Definition ConvexPolygon.h:162
bool isDisjointFrom(Region const &r) const
Definition ConvexPolygon.cc:352
static ConvexPolygon convexHull(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.h:73
Relationship relate(Region const &r) const override
Definition ConvexPolygon.h:152
Circle getBoundingCircle() const override
getBoundingCircle returns a bounding-circle for this region.
Definition ConvexPolygon.cc:336
ConvexPolygon(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.cc:264
Box getBoundingBox() const override
getBoundingBox returns a bounding-box for this region.
Definition ConvexPolygon.cc:340
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:305
bool operator==(ConvexPolygon const &p) const
Two convex polygons are equal iff they contain the same points.
Definition ConvexPolygon.cc:270
bool isWithin(Region const &r) const
Definition ConvexPolygon.cc:360
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:63
Definition UnitVector3d.h:62
Relationship invert(Relationship r)
Definition Relationship.h:62
std::bitset< 3 > Relationship
Relationship describes how two sets are related.
Definition Relationship.h:42