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));
120 bool isEmpty()
const override;
122 Box getBoundingBox()
const override;
123 Box3d getBoundingBox3d()
const override;
124 Circle getBoundingCircle()
const override;
129 bool contains(UnitVector3d
const & v)
const override;
130 bool contains(Region
const & r)
const;
133 using Region::contains;
150 bool isWithin(Region
const & r)
const;
155 return invert(r.relate(*
this));
163 TriState overlaps(Region
const& other)
const override {
164 return other.overlaps(*
this);
166 TriState overlaps(Box
const &)
const override;
167 TriState overlaps(Circle
const &)
const override;
169 TriState overlaps(Ellipse
const &)
const override;
171 std::vector<std::uint8_t> encode()
const override;
175 static std::unique_ptr<ConvexPolygon>
decode(std::vector<std::uint8_t>
const & s) {
176 return decode(s.data(), s.size());
178 static std::unique_ptr<ConvexPolygon>
decode(std::uint8_t
const * buffer,
size_t n);
182 typedef std::vector<UnitVector3d>::const_iterator VertexIterator;
190 std::string toIvoaStcsBody(std::string
const & frame =
"")
const override;
192 std::vector<UnitVector3d> _vertices;
195std::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:175
ConvexPolygon(UnitVector3d const &v0, UnitVector3d const &v1, UnitVector3d const &v2, UnitVector3d const &v3)
Definition ConvexPolygon.h:96
bool intersects(Region const &r) const
Definition ConvexPolygon.cc:365
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:353
bool isDisjointFrom(Region const &r) const
Definition ConvexPolygon.cc:361
static ConvexPolygon convexHull(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.h:73
ConvexPolygon(std::vector< UnitVector3d > const &points)
Definition ConvexPolygon.cc:264
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:369
Definition UnitVector3d.h:62
Definition _continue_class.py:109
Relationship invert(Relationship r)
Definition Relationship.h:62
std::bitset< 3 > Relationship
Relationship describes how two sets are related.
Definition Relationship.h:42