Subject: CGAL users discussion list
List archive
- From: Stefan Salewski <>
- To: "" <>
- Subject: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D
- Date: Fri, 04 Oct 2013 13:25:36 +0200
I have a set of circles in 2d, they differ much in size and may partly
or fully overlap. I need to identify the ones which touch the convex
hull of the set, so that I can drop the inner ones.
I have experimented with some sort of graham scan, after circular
sorting and calculation tangents. While that seemed to work for most
cases, I noted that it still may fail for special cases, i.e when there
is a very big difference in size.
Yesterday I found this paper
On Computing the Convex Hull of (Piecewise) Curved Objects by Franz
Aurenhammer and Bert JÜttler
www.igi.tugraz.at/auren/psfiles/aj-cchpco-12.pdf
For me that is a very abstract theoretical description.
Is there a chance to convert that paper into real code?
Or any other suggestions?
Best regards,
Stefan Salewski
- [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, Stefan Salewski, 10/04/2013
- Re: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, Andreas Fabri, 10/04/2013
- Re: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, Stefan Salewski, 10/06/2013
- Re: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, jiju peethambaran, 10/04/2013
- Re: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, Olivier Devillers, 10/08/2013
- Re: [cgal-discuss] Convex hull of circles, disk, circular arcs in 2D, Andreas Fabri, 10/04/2013
Archive powered by MHonArc 2.6.18.