BWDelaunay.hpp

Go to the documentation of this file.

// This file is part of GranOO, a workbench for DEM simulation.
//
// Author(s)    : - Damien Andre       IRCER/UNILIM, Limoges France
//                  <damien.andre@unilim.fr>
//                - Jean-luc Charles   Arts et Metiers ParisTech, CNRS, I2M, Bordeaux France
//                  <jean-luc.charles@ensam.eu>
//                - Jeremie Girardot   Arts et Metiers ParisTech, CNRS, I2M, Bordeaux France
//                  <jeremie.girardot@ensam.eu>
//                - Cedric Hubert      LAMIH/UPHF, Valenciennes France
//                  <cedric.hubert@uphf.fr>
//                - Ivan Iordanoff     Arts et Metiers ParisTech, CNRS, I2M, Bordeaux France
//                  <ivan.iordanoff@ensam.eu>
//
// Copyright (C) 2008-2019 D. Andre, JL. Charles, J. Girardot, C. Hubert, I. Iordanoff
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
#ifndef BWDelaunay_H
#define BWDelaunay_H
 
#include <vector>
#include <string>
 
class BWDelaunay {
 
public:
  BWDelaunay(const std::vector<double> &points);
 
public:
  void set_vertices(const std::vector<double> &points);
 
  void tetrahedralize();
 
  unsigned int vertex_number() {
    return (unsigned int)(_vertices.size()/3);
  };
 
  inline const double *vertex_ptr(unsigned int vertexIndex) const {
    return &(_vertices[3*vertexIndex]);
  };
 
  unsigned int edge_number() {
    return (unsigned int)(_edgesToVertex.size()/2);
  };
 
  inline const unsigned int *edge_ptr(unsigned int edgeIndex) const {
    return &(_edgesToVertex[2*edgeIndex]);
  };
 
  void export_to_mesh_file(std::string filePath);
 
private:
  unsigned int new_tetrahedron();
 
  unsigned int new_tetrahedron(unsigned int v0Index, unsigned int v1Index, unsigned int v2Index, unsigned int v3Index);
 
  void delete_tetrahedron(unsigned int tetIndex);
 
  void tetrahedron_circum_centre(double (&centre)[3], unsigned int tetIndex);
 
  bool is_point_inside_tet_circumsphere(unsigned int pointIndex, unsigned int tetIndex);
 
  bool is_virtual_tetrahedron(unsigned int tetIndex);
 
private:
  static const unsigned int NotInList = (unsigned int)(-1);
 
private:
  std::vector<double> _vertices;
 
  std::vector<unsigned int> _virtualVertices;
 
  std::vector<unsigned int> _tetToVertex;
 
  std::vector<unsigned int> _tetToTet;
 
  std::vector<unsigned int> _nextTetrahedron;
 
  std::vector<unsigned int> _edgesToVertex;
 
  std::vector<double> _circumRadii;
 
  std::vector<double> _circumCentres;
 
  unsigned int _firstFreeTetIndex;
 
  double _minPoint[3];
 
  double _midPoint[3];
 
  double _maxPoint[3];
};
 
 
 
#endif