HTM SpatialIndex Class Reference

class SpatialConvex : public SpatialSign

A spatial convex is composed of spatial constraints

Inheritance:


Public Methods

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
SpatialConvex& operator = (const SpatialConvex &)
Assignment
void add (SpatialConstraint &)
Add a constraint
void simplify ()
Simplify the convex, remove redundancies
void intersect (const SpatialIndex * index, BitList * partial, BitList * full)
Intersect with index
void intersect (const SpatialIndex * index, ValVec * partial, ValVec * full)
Intersect with index
void intersect (const SpatialIndex * index, ValVec * idList)
Intersect with index
size_t numConstraints ()
Return the number of constraints
SpatialConstraint& operator [] (size_t i)
[] operator: give back constraint
void read (istream&)
read from stream
void readRaDec (istream&)
read from stream
void write (ostream&) const
write to stream

Inherited from SpatialSign:

Protected Fields

Sign sign_

Documentation

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()
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

SpatialConvex& operator =(const SpatialConvex &)
Assignment

void add(SpatialConstraint &)
Add a constraint

void simplify()
Simplify the convex, remove redundancies

void intersect(const SpatialIndex * index, BitList * partial, BitList * full)
Intersect with index. The partial and full bitlists for the result have to be given. If the conves occupies a large percent of the area of the sphere, bitlists are the preferred result method.

void intersect(const SpatialIndex * index, ValVec * partial, ValVec * full)
Intersect with index. Same intersection as with bitlists (see above), but the result is given in a list of nodes. If the conves is very small, this is the preferred result method.

void intersect(const SpatialIndex * index, ValVec * idList)
Intersect with index. Now only a single list of IDs is returned. The IDs need not be level.

size_t numConstraints()
Return the number of constraints

SpatialConstraint& operator [](size_t i)
[] operator: give back constraint

void read(istream&)
read from stream

void readRaDec(istream&)
read from stream

void write(ostream&) const
write to stream


This class has no child classes.

alphabetic index hierarchy of classes


© Copyright The Johns Hopkins University 1999, All Rights Reserved.
Peter Z. Kunszt,

generated by doc++