A spatial domain is a list of spatial convexes
![]() | index |
![]() | topBit_ The vector of convexes |
![]() | SpatialDomain (const SpatialIndex * idx = 0) Constructor |
![]() | ~SpatialDomain () Destructor |
![]() | setIndex (const SpatialIndex *) Set index pointer |
![]() | add (SpatialConvex &) Add a convex |
![]() | simplify () Simplify the Domain, remove redundancies |
![]() | intersect (const SpatialIndex * idx, BitList & partial, BitList & full) Intersect with index |
![]() | intersect (const SpatialIndex * idx, ValVec Same intersection, but return vectors of ids instead of bitlists. |
![]() | intersect (const SpatialIndex * idx, ValVec Same intersection, but return just a list of IDs not level depth |
![]() | numConvexes () numConvexes: give back the number of convexes |
![]() | operator [] (size_t i) [] operator: give back convex |
![]() | read (istream&) read from stream |
![]() | write (ostream&) const write to stream |
![]() | ignoreCrLf (istream &) A pointer to the index |
![]() | convexes_ |
A spatial domain is a list of spatial convexes. So we can have really disjoint pieces of the sky defined by a domain.
~SpatialDomain()
void setIndex(const SpatialIndex *)
void add(SpatialConvex &)
void simplify()
bool intersect(const SpatialIndex * idx, BitList & partial, BitList & full)
bool intersect(const SpatialIndex * idx, ValVec
bool intersect(const SpatialIndex * idx, ValVec
size_t numConvexes()
SpatialConvex& operator [](size_t i)
void read(istream&)
void write(ostream&) const
const SpatialIndex* index
static void ignoreCrLf(istream &)
alphabetic index hierarchy of classes