CGAL users discussion list

[Daniel Duque <>]

Hello,

This looks like a work for alpha-shapes. As you can imagine, the 
"strangeness" of some points is hard to define, but playing around with 
these shapes can be very interesting. Keep in mind there is a crucial 
parameter, alpha, and carefully read the (excellent) documentation:

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Alpha_shapes_3/Chapter_main.html

Good luck,

Daniel


El 30/01/2012 20:48, Juan Carlos Lopez Alfonso escribió:
> Hi all,
>
> I am writing to this list because here there are a lot of expert
> professionals in different geometric algorithms. Is there an algorithm
> in CGAL to obtain the oposite of the convex hull? For example, I have
> a 2D set of points (see attached image) and I want to obtain the
> maximal convex polygon, which has the highest number of points on the
> border. Concretely, I want to remove the points that do strange things
> at the border (points inside ellipses).
>
> Best regards
> Juan Carlos