CGAL users discussion list

[Frédérik Paradis <>]

The code you showed has:
(distance_vw - 2.*max_rad) > s*max_rad
which I can rewrite:
distance_vw > (s+2)*max_rad
and I can square both sides.

Sure, in some cases removing the square roots can be harder, but it is doable.

Alright, I see thank you.

Try harder? That is the most natural way in CGAL. If you have trouble with it, maybe you can ask here with specific code. Maybe there is a real obstruction that prevents from using this solution here, but you would likely be asked to explain it before integrating code that uses a different strategy.

Actually, my problem is that the constructor of Sphere_d is not the same as constructing a Circle_2. Sphere_d takes an iterator of Point_d whereas Point_2 only takes three points or a center with a radius. Do you know how I could work around that?

Thank you.

Frédérik