#include <gudhi/Alpha_complex.h>
#include <gudhi/Simplex_tree.h>
 
#include <CGAL/Epeck_d.h>
 
#include <iostream>
#include <vector>
 
using Kernel = CGAL::Epeck_d< CGAL::Dimension_tag<2> >;
using Point = Kernel::Point_d;
using Vector_of_points = std::vector<Point>;
 
int main() {
  
  
  
  Vector_of_points points;
  points.push_back(Point(1.0, 1.0));
  points.push_back(Point(7.0, 0.0));
  points.push_back(Point(4.0, 6.0));
  points.push_back(Point(9.0, 6.0));
  points.push_back(Point(0.0, 14.0));
  points.push_back(Point(2.0, 19.0));
  points.push_back(Point(9.0, 17.0));
 
  
  
  
 
    
    
    
    std::clog << 
"Alpha complex is of dimension " << simplex.
dimension() <<
 
    std::clog << "Iterator on alpha complex simplices in the filtration order, with [filtration value]:" << std::endl;
      std::clog << "   ( ";
        std::clog << vertex << " ";
      }
      std::clog << 
") -> " << 
"[" << simplex.
filtration(f_simplex) << 
"] ";
      std::clog << std::endl;
    }
  }
  return 0;
}
Simplex Tree data structure for representing simplicial complexes.
Definition: Simplex_tree.h:81
Filtration_simplex_range const & filtration_simplex_range(Indexing_tag=Indexing_tag())
Returns a range over the simplices of the simplicial complex, in the order of the filtration.
Definition: Simplex_tree.h:273
Simplex_vertex_range simplex_vertex_range(Simplex_handle sh) const
Returns a range over the vertices of a simplex.
Definition: Simplex_tree.h:284
static Filtration_value filtration(Simplex_handle sh)
Returns the filtration value of a simplex.
Definition: Simplex_tree.h:537
size_t num_vertices() const
Returns the number of vertices in the complex.
Definition: Simplex_tree.h:574
int dimension(Simplex_handle sh)
Returns the dimension of a simplex.
Definition: Simplex_tree.h:602
size_t num_simplices()
returns the number of simplices in the simplex_tree.
Definition: Simplex_tree.h:580
Alpha complex data structure.
Definition: Alpha_complex.h:103
bool create_complex(SimplicialComplexForAlpha &complex, Filtration_value max_alpha_square=std::numeric_limits< Filtration_value >::infinity(), bool exact=false, bool default_filtration_value=false)
Inserts all Delaunay triangulation into the simplicial complex. It also computes the filtration value...
Definition: Alpha_complex.h:372