CGAL users discussion list

[Nico Kruithof <>]

Hi Ramin,

I would find an initial face intersecting the disk and then
recursively test all incident faces. You can also find all triangles
that intersect the bounding sphere. You can find these by walking over
the circle. Then finding all faces is a matter of finding the faces
that lie within the region bound by the selected triangles.

Nico

On 3 apr. 2013, at 19:31, Ramin H <> wrote:

> I have a 2D triangulation with a large number triangles (100 thousands) and a disc with radius r.
>
> I would like to get a list of all the triangles that intersect with the disc.
>
> Is there a facility in CGAL to make a query like this against a 2D triangulation?
> What would be the best approach to solve this problem efficiently?
>
> Thank you,
> -Ramin
>



-- 
Nico Kruithof

nghk.nl