CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 01/18/2012 11:43 AM, hidding wrote:
> Apparently the mail-system removes the "raw" tags, here's the typedefs:
> typedef CGAL::Cartesian<double>  K;
> typedef CGAL::Weighted_alpha_shape_euclidean_traits_2<K>  Gt;
> typedef CGAL::Alpha_shape_vertex_base_2<Gt>  Av;
>
> typedef CGAL::Regular_triangulation_face_base_2<Gt>  Rf;
> typedef CGAL::Alpha_shape_face_base_2<Gt,Rf>   Af;
>
> typedef CGAL::Triangulation_default_data_structure_2<Gt,Av,Af>  Tds;
> typedef CGAL::Regular_triangulation_2<Gt,Tds>  Rt;
> typedef CGAL::Alpha_shape_2<Rt>  AS;
>
> and the given compiler error (gcc-4.6, CGAL-3.8):
> CGAL::Alpha_shape_vertex_base_2<yada yada ...>  has no member named
> 'is_hidden' / 'set_hidden'.
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/weighted-alpha-shape-2d-minimal-example-tp4306254p4306270.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
CGAL's source is coming with an example
examples/Alpha_shapes_2/ex_weighted_alpha_shapes_2.cpp

WARNING: you also need the file data/fin

Sebastien.
/***********************************************************************

Takes a list of points and returns a list of segments corresponding to
the weighted Alpha Shape.

************************************************************************/

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Weighted_point.h>
#include <CGAL/Weighted_alpha_shape_euclidean_traits_2.h>
#include <CGAL/Regular_triangulation_2.h>
#include <CGAL/Alpha_shape_2.h>

#include <iostream>
#include <fstream>
#include <vector>
#include <list>


typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::FT FT;
typedef K::Point_2 Point_base;
typedef CGAL::Weighted_point<Point_base,FT>  Point;
typedef K::Segment_2  Segment;

typedef CGAL::Weighted_alpha_shape_euclidean_traits_2<K> Gt;
typedef CGAL::Regular_triangulation_vertex_base_2<Gt> Rvb;
typedef CGAL::Alpha_shape_vertex_base_2<Gt,Rvb> Vb;
typedef CGAL::Regular_triangulation_face_base_2<Gt> Rf;
typedef CGAL::Alpha_shape_face_base_2<Gt, Rf>  Fb;

typedef CGAL::Triangulation_data_structure_2<Vb,Fb> Tds;
typedef CGAL::Regular_triangulation_2<Gt,Tds> Triangulation_2;

typedef CGAL::Alpha_shape_2<Triangulation_2>  Alpha_shape_2;

typedef Alpha_shape_2::Face  Face;
typedef Alpha_shape_2::Vertex Vertex;
typedef Alpha_shape_2::Edge Edge;
typedef Alpha_shape_2::Face_handle  Face_handle;
typedef Alpha_shape_2::Vertex_handle Vertex_handle;

typedef Alpha_shape_2::Face_circulator  Face_circulator;
typedef Alpha_shape_2::Vertex_circulator  Vertex_circulator;

typedef Alpha_shape_2::Locate_type Locate_type;

typedef Alpha_shape_2::Face_iterator  Face_iterator;
typedef Alpha_shape_2::Vertex_iterator  Vertex_iterator;
typedef Alpha_shape_2::Edge_iterator  Edge_iterator;
typedef Alpha_shape_2::Edge_circulator  Edge_circulator;

typedef Alpha_shape_2::Alpha_iterator Alpha_iterator;
typedef Alpha_shape_2::Alpha_shape_edges_iterator Alpha_shape_edges_iterator;
//---------------------------------------------------------------------

template <class InputIterator, class OutputIterator>
void
alpha_edges(InputIterator begin, InputIterator end,
	    const FT &Alpha,
	    bool mode,
	    OutputIterator out)
  // Generate Alpha Shape
{
  std::vector<Gt::Segment_2> V_seg;
  Alpha_shape_2 A(begin,end);

  if (mode)
    { A.set_mode(Alpha_shape_2::GENERAL); }
  else
    { A.set_mode(Alpha_shape_2::REGULARIZED); };
  A.set_alpha(Alpha);

  for(Alpha_shape_edges_iterator it =  A.alpha_shape_edges_begin();
      it != A.alpha_shape_edges_end();
      ++it){
    *out++ = A.segment(*it);
  }
}

//---------------------------------------------------------------------
bool
file_input(std::list<Point>& L)
{

  std::ifstream is("./data/fin", std::ios::in);

  if(is.fail())
    {
      std::cerr << "unable to open file for input" << std::endl;
      return false;
    }

  CGAL::set_ascii_mode(is);

  int n;
  is >> n;
  std::cout << "Reading " << n << " points" << std::endl;
  Point_base p;
  for( ; n>0 ; n--)
    {
      is >> p;
      L.push_back(Point (p, FT(10)));
    }
  std::cout << "Points inserted" << std::endl;
  return true;
}

//------------------ main -------------------------------------------

int main()
{
  std::list<Point> points;
  file_input(points);
  std::vector<Gt::Segment_2> segments;
  alpha_edges(points.begin(), points.end(),
	      FT(10000),Alpha_shape_2::GENERAL,
	      std::back_inserter(segments));
  std::cout << segments.size() << " alpha shape edges." << std::endl;
  return 0;
}