SnapObject.h

Go to the documentation of this file.

#ifndef SNAPOBJECT_H
#define SNAPOBJECT_H

#include <vrecko/EnvironmentObject.h>
#include "functions.h"



class SnapObject 
{
public:
    SnapObject();
    SnapObject(int id);
    SnapObject(int id, vrecko::EnvironmentObject *eo);
    ~SnapObject();

private:
    unsigned long ID;
    vrecko::EnvironmentObject *eo;  


    //temporary variables for computing
    
    bool graph_dirty; //if there is need to update graph set this value to true
    vector<map<int, int>> * graph; //graph of object - edges
    
    bool simpleGraph_dirty;
    vector<set<int>> * simpleGraph; //simple graph without count of edges


    bool maxDistance_dirty; //if there is need to compute this distance
    float maxDistance; //max geodesic distance targetMaxDistance from boundary loop

    bool snappingRegion_dirty;
    vector<int> snappingRegion; //snaping region
    vector<float> * snappingRegionValues; //distance of aech point in snapping region to the boundary loop

    bool boundaryLoop_dirty;
    vector<vector<int>> * boundaryLoop; //closest point to boundary loop
    vector<osg::Vec3> boundaryLoopCentroids;
    unsigned long choosenBoundaryLoop;

    bool closestPoint_dirty;
    vector<int> closestPoint; //closest point to boundary loop

public:
    void setId(unsigned long ID);
    unsigned long getId();

    void setEo(vrecko::EnvironmentObject* eo);
    vrecko::EnvironmentObject* getEo();

    void setDirtyGraph(bool dirty);
    bool getDirtyGraph();

    void setDirtyMaxDistance(bool dirty);
    bool getDirtyMaxDistance();

    void setDirtySnappingRegion(bool dirty);
    bool getDirtySnappingRegion();

    void setDirtyBoundaryLoop(bool dirty);
    bool getDirtyBoundaryLoop();

    void setDirtyClosestPoint(bool dirty);
    bool getDirtyClosestPoint();

    void setDirtyAll(bool dirty);

    void setChoosenBoundaryLoop(unsigned long position);
    unsigned long getChoosenBoundaryLoop();



//FUNCTIONS
public:
    //get geode of node graf
    osg::Geode* getGeode();
    osg::Geode* getGeodeOf(osg::Node *eo);

    //get geometry of node graf
    osg::Geometry* getGeometry();

    //get vertices
    osg::Vec3Array* getVertices();

    //get colors
    osg::Vec4Array* getColors();

    //get normals
    osg::Vec3Array* getNormals();

    //get faces
    osg::DrawElementsUShort* getFaces();

    //get primitive set - store count of point and definition
    osg::PrimitiveSet* getPrimitiveSet();


    //get boundary loop of object
    vector<vector<int>> * getBoundaryLoops();
    vector<vector<int>> * findBoundaryLoops();
    vector<int> getBoundaryLoop();
    vector<osg::Vec3> getBoundaryLoopCentroids();
    bool chooseBoundaryLoop(SnapObject *object); //choose chich loop of each object we will use


    //getGraph
    vector<map<int, int>> * getGraph();
    vector<map<int, int>> * createGraph();

    vector<set<int>> * getSimpleGraph();
    vector<set<int>> * createSimpleGraph();

    vector<int> getSnapRegion();

    vector<int> getClosestPoint(SnapObject *object);
    vector<int> findClosestPoint(SnapObject *object);

    vector<int> getClosestSnappingRegionPoints(SnapObject *object);
    vector<int> findClosestSnappingRegionPoints(SnapObject *object);


    //getSnappingRegion
    //optimalization - combine findMaxDistance and getSnappingRegion
    vector<int> getSnappingRegion();
    vector<float> * getSnappingRegionValues();
    float getMaxDistance();
    vector<int> getSnapRegionWithDistanceSet();


    //shortest path
    vector<int> findShortestPath(int pointA, int pointB);

    void updateDisplayList();
    void deleteFromScene();
    void recomputeNormal();

    bool erasePoints(vector<int> &boundaryLoopToErase, vector<int> &eraseLoop); 
    bool erasePointsAndAllFaces(vector<int> &boundaryLoopToErase, vector<int> &eraseLoop);
    bool mergeObject(SnapObject *object);

    int findClosestPoint(osg::Vec3 point);

    //get part of object - we have seed and boundary loop   
    set<int> getPartOfObject(int seed, set<int> cuttingLoopSet);

    //return true if object is suitable for processing
    bool SnapObject::isSuitable();


    void optimalizeLoop(vector<int> &loop);  

};

#endif // SNAPOBJECT_H