A spatial convex is composed of spatial constraints
![]() | SpatialConvex () Default Constructor |
![]() | SpatialConvex (const SpatialVector * v1, const SpatialVector * v2, const SpatialVector * v3) Constructor from a triangle |
![]() | SpatialConvex (const SpatialVector * v1, const SpatialVector * v2, const SpatialVector * v3, const SpatialVector * v4) Constructor from a rectangle |
![]() | SpatialConvex (const SpatialConvex &) Copy constructor |
![]() | operator = (const SpatialConvex &) Assignment |
![]() | add (SpatialConstraint &) Add a constraint |
![]() | simplify () Simplify the convex, remove redundancies |
![]() | intersect (const SpatialIndex * index, BitList * partial, BitList * full) Intersect with index |
![]() | intersect (const SpatialIndex * index, ValVec Intersect with index |
![]() | intersect (const SpatialIndex * index, ValVec Intersect with index |
![]() | numConstraints () Return the number of constraints |
![]() | operator [] (size_t i) [] operator: give back constraint |
![]() | read (istream&) read from stream |
![]() | readRaDec (istream&) read from stream |
![]() | write (ostream&) const write to stream |
A spatial convex is composed of spatial constraints. It does not necessarily define a continuous area on the sphere since it is a 3D-convex of planar intersections which may intrersect with the unit sphere at disjoint locations. Especially 'negative' constraints tend to tear 'holes' into the convex area.
SpatialConvex(const SpatialVector * v1, const SpatialVector * v2, const SpatialVector * v3)
SpatialConvex(const SpatialVector * v1, const SpatialVector * v2, const SpatialVector * v3, const SpatialVector * v4)
SpatialConvex(const SpatialConvex &)
SpatialConvex& operator =(const SpatialConvex &)
void add(SpatialConstraint &)
void simplify()
void intersect(const SpatialIndex * index, BitList * partial, BitList * full)
void intersect(const SpatialIndex * index, ValVec
void intersect(const SpatialIndex * index, ValVec
size_t numConstraints()
SpatialConstraint& operator [](size_t i)
void read(istream&)
alphabetic index hierarchy of classes