Skip to Content.
Sympa Menu

cgal-discuss - Re: Re: [cgal-discuss] Alpha Shape 2 - No Edge Detection

Subject: CGAL users discussion list

List archive

Re: Re: [cgal-discuss] Alpha Shape 2 - No Edge Detection


Chronological Thread 
  • From: Michael Jeulin-L <>
  • To:
  • Subject: Re: Re: [cgal-discuss] Alpha Shape 2 - No Edge Detection
  • Date: Thu, 5 Nov 2009 11:34:25 +0100 (CET)

I`m trying to take example in this function :

template < class Dt >
int
Alpha_shape_2<Dt>::number_of_solid_components(const Coord_type& alpha) const
{
// Determine the number of connected solid components
typedef typename Marked_face_set::Data Data;
Marked_face_set marked_face_set(false);
Finite_faces_iterator face_it;
int nb_solid_components = 0;

if (number_of_vertices()==0)
return 0;

// only finite faces
for( face_it = faces_begin();
face_it != faces_end();
++face_it)
{
Face_handle pFace = face_it;
CGAL_triangulation_postcondition( pFace != NULL);

if (classify(pFace, alpha) == INTERIOR){
Data& data = marked_face_set[pFace];
if(data == false)
{
// we traverse only interior faces
traverse(pFace, marked_face_set, alpha);
nb_solid_components++;
}
}
}
return nb_solid_components;
}

but I`m still a little quite bit lost about that.
Could Someone redirect me somewhere in order to find more information please ?

I suppose I not using the shape iterator correctly to find the right order of
all of my segments to reconstruct my polygons.
Plus, I`ll have to compute with some adjacent polygons... So It doesn`t seems
to be the right way.

I also look in polygon package to see if I could from a complexe polygon,
subdivide it into a set a simple polygons... but no way to find some
information about that.

Does someone have any idea please ?



Archive powered by MHonArc 2.6.16.

Top of Page