Polyhedron_algorithms.h

Go to the documentation of this file.

#pragma once
 
#ifndef _POLYHEDRON_ALGORITHMS
#  define _POLYHEDRON_ALGORITHMS
 
#  include <sch/Matrix/SCH_Types.h>
#  include <sch/S_Polyhedron/S_PolyhedronVertex.h>
#  include <string>
#  include <vector>
namespace sch
{
struct PolyhedronTriangle
{
  unsigned int a, b, c;
  Vector3 normal;
 
public:
  template<class Archive>
  void serialize(Archive & ar, const unsigned int /*version*/)
  {
    ar & a;
    ar & b;
    ar & c;
    ar & normal;
  }
};
 
struct PolyhedronEdge
{
  size_t a, b;
  Vector3 edge;
 
public:
  template<class Archive>
  void serialize(Archive & ar, const unsigned int /*version*/)
  {
    ar & a;
    ar & b;
    ar & edge;
  }
  void computeEdge(const std::vector<S_PolyhedronVertex *> & v)
  {
    const Vector3 & p1 = v[a]->getCoordinates();
    const Vector3 & p2 = v[b]->getCoordinates();
    edge = p1 - p2;
  }
};
 
struct Polyhedron_algorithms
{
public:
  SCH_API Polyhedron_algorithms(void);
  SCH_API Polyhedron_algorithms(const Polyhedron_algorithms &);
 
  SCH_API ~Polyhedron_algorithms(void);
 
  SCH_API const Polyhedron_algorithms & operator=(const Polyhedron_algorithms &);
 
  SCH_API void updateFastArrays();
 
  SCH_API Point3 naiveSupport(const Vector3 & v) const;
 
  SCH_API void updateVertexNeighbors();
 
  SCH_API void clearNeighbors();
 
  SCH_API void clear();
 
  SCH_API void deleteVertexesWithoutNeighbors();
 
  SCH_API Point3 support(const Vector3 & v, int & lastFeature) const;
 
  SCH_API void openFromFile(const std::string & filename);
 
  SCH_API void fillEdges();
 
  SCH_API size_t getEdgeKey(PolyhedronEdge e);
 
  template<class Archive>
  void serialize(Archive & ar, const unsigned int /*version*/)
  {
    ar & vertexes_;
    ar & triangles_;
    // ar & fastVertexes_;
    // ar & lastVertexes_;
  }
 
  std::vector<S_PolyhedronVertex *> vertexes_;
 
  std::vector<PolyhedronTriangle> triangles_;
  std::vector<PolyhedronEdge> edges_;
 
  S_PolyhedronVertex ** fastVertexes_;
  S_PolyhedronVertex ** lastVertexes_;
  unsigned numberOfVertices_;
};
} // namespace sch
 
#endif