igeomset.h

Go to the documentation of this file.

#pragma once
// igeomset.h
 
#include "shared/interface/signal.h"
#include "igeomimportexport.h"
namespace itasca {
    class IThing;
    class IContainer;
}
 
namespace itascaxd {
    using namespace itasca;
 
    class IGeomPoint;
    class IGeomEdge;
    class IGeomPoly;
    class GeomBase;
 
    class IGeomSet {
    public:
        inline static const TType type_ = 0x4c815bd0;
 
        virtual const GeomBase *getGeomBase() const=0;
 
        virtual IThing *        getIThing()=0;
        virtual const IThing *  getIThing() const=0;
        virtual IGeomSet *      getNext()=0;
        virtual const IGeomSet *getNext() const=0;
 
        virtual IString         getName() const=0;
        virtual uint            getGeometryCode() const=0;
        virtual uint            getGroupCode() const=0;
        virtual uint            getExtraCode() const=0;
 
        virtual IGeomPoint *      createPoint(const DVect3 &pos,uint64 id=0)=0;
        virtual IGeomPoint *      getFirstPoint()=0;
        virtual const IGeomPoint *getFirstPoint() const=0;
        virtual IGeomPoint *      findPointWithID(uint64 id)=0;
        virtual const IGeomPoint *findPointWithID(uint64 id) const=0;
        virtual IGeomPoint *      findClosestPoint(const DVect &pos,const double &radius=limits<double>::max())=0;
        virtual IContainer *      getPointContainer()=0;
        virtual const IContainer *getPointContainer() const=0;
 
        virtual IGeomEdge *       createEdge(IGeomPoint *end1,IGeomPoint *end2)=0;
        virtual IGeomEdge *       getFirstEdge()=0;
        virtual const IGeomEdge * getFirstEdge() const=0;
        virtual IGeomEdge *       findEdgeWithID(uint64 id)=0;
        virtual const IGeomEdge * findEdgeWithID(uint64 id) const=0;
        virtual IGeomEdge *       findClosestEdge(const DVect &pos,const double &radius=limits<double>::max())=0;
        virtual const IGeomEdge * findClosestEdge(const DVect &pos,const double &radius=limits<double>::max()) const=0;
        virtual IGeomEdge *       findMatchingEdge(const IGeomPoint *end1,const IGeomPoint *end2)=0;
        virtual const IGeomEdge * findMatchingEdge(const IGeomPoint *end1,const IGeomPoint *end2) const=0;
        virtual IContainer *      getEdgeContainer()=0;
        virtual const IContainer *getEdgeContainer() const=0;
 
        virtual IGeomPoly *       createPoly()=0;
        virtual IGeomPoly *       getFirstPoly()=0;
        virtual const IGeomPoly * getFirstPoly() const=0;
        virtual IGeomPoly *       findPolyWithID(uint64 id)=0;
        virtual const IGeomPoly * findPolyWithID(uint64 id) const=0;
        virtual IGeomPoly *       findClosestPoly(const DVect &pos,const double &radius=limits<double>::max())=0;
        virtual const IGeomPoly * findClosestPoly(const DVect &pos,const double &radius=limits<double>::max()) const=0;
        virtual IGeomEdge *       addNodeToPoly(IGeomPoly *poly,IGeomPoint *point)=0;
        virtual IGeomEdge *       closePoly(IGeomPoly *poly)=0;
        virtual IContainer *      getPolyContainer()=0;
        virtual const IContainer *getPolyContainer() const=0;
        virtual shared::Signal<const IThing *,const IContainer *> *getPointMovedSignal() const=0;
        virtual shared::Signal<const IThing *,const IContainer *> *getEdgeMovedSignal() const=0;
        virtual shared::Signal<const IThing *,const IContainer *> *getPolyMovedSignal() const=0;
 
        virtual std::pair<DVect,bool> findClosestPointOnSet(const DVect &pos,bool polysOnly,double radius=limits<double>::max()) const=0;
        virtual double findDistanceOnSetFromRay(const DVect &pos, const DVect &ray) const = 0;
 
        virtual std::vector<const IGeomPoly *> getEdgeConnectedMesh(const IGeomPoly *poly) const=0;
        virtual std::vector<const IGeomEdge *> getVertexConnectedMesh(const IGeomEdge *edge) const=0;
        virtual void exportData(IGeometryImportData *)=0;
#ifdef THREED
        virtual bool       checkClosedVolume()=0;
#endif
        virtual std::vector<const IThing *> marqueeDeepSelect(bool perspective, const FArray<DVect>& nearSelRect, 
                        const FArray<DVect>& farSelRect, const DVect& selectionDirection, TType objType)const=0;
        virtual void listObjectAlongLine(const DVect &beg, const DVect &e,double radius, FArray<const IGeomPoint *> *retPoints, 
                             FArray<std::pair<const IGeomEdge *, DVect>> *retEdges, 
                             FArray<std::pair<const IGeomPoly *, DVect>> *intersectPolyPoints, const double tolerance)const =0;
        virtual void listObjectAlongCone(const DVect &origin, const DVect &beginning, 
                  const double &angle, FArray<const IGeomPoint *> *retPoints, 
                  FArray<std::pair<const IGeomEdge *, DVect>> *retEdges, 
                  FArray<std::pair<const IGeomPoly *, DVect>> *intersectPolyPoints, bool *nonPlanarPolyDetected,
                  double tolerance, const double *depth=0) const = 0;
        virtual void listObjectAlongCylinder(const DVect &origin, const DVect &beginning, const double &radius, 
                  FArray<const IGeomPoint *> *retPoints, FArray<std::pair<const IGeomEdge *, DVect>> *retEdges, 
                  FArray<std::pair<const IGeomPoly *, DVect>> *intersectPolyPoints, 
                  double tolerance, const double *depth=0) const = 0;
        // returns true if at least a point is shared (no check for valid pointers)
        virtual bool sharePoint(const IGeomEdge *edge1, const IGeomEdge *edge2, const IGeomPoint **shared=0) const = 0;
        // returns true if the geometry is planar within a tolereance
        virtual bool isPlanar(double tolerance = 1e-6) const = 0;
 
    };
} // namespace itascaxd
// EoF