CGAL users discussion list

[Ramin H <>]

Thank you Nico. Good idea.

Building on your suggestion, since in my case, the center of disc is always within the triangulation, I can find the triangle that center of disc falls in and then recursively test for the rest of the neighboring  triangles as follows:

- For each edge of the triangle, find the distance between the edge and the center of the disc

- If the minimum of these 3 distances is less than the disc radius, the triangle intersects with the disc or lies within the disc

Ramin

On Wed, Apr 3, 2013 at 2:44 PM, Nico Kruithof <> wrote:

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