CGAL users discussion list

[Giles Bathgate <>]

Maybe this would be a good start:

http://en.wikipedia.org/wiki/Closest_pair_of_points

Regards,
Giles

On 28 July 2014 13:04, Dimitris Tzionas 
<>
 wrote:
> Thanks for the link Giles!
> It is interesting, following a different approach than what I was expecting,
> but I'm afraid it's not exactly what I need.
> I would really need the id's of the vertices (or triangles), not just the
> distance.
> If I'm not mistaken this method finds the distance between the two convex
> hulls, without really finding the hulls.
> So in the end of the day vertex-IDs are probably still missing.
>
> I think that CGAL::all_furthest_neighbors_2 does kind of what I need, but in
> the opposite way.
>
> Any other thought or hint on this problem would be highly appreciated.
>
>
>
> On Mon, Jul 28, 2014 at 12:27 PM, Giles Bathgate 
> <>
> wrote:
>>
>> Is this what you are looking for?
>>
>>
>> http://doc.cgal.org/latest/Polytope_distance_d/group__PkgOptimalDistances.html
>>
>> On 28 July 2014 11:19, Dimitris Tzionas 
>> <>
>>  wrote:
>> > Hi all,
>> >
>> > I would like to find two vertices of two meshes (1 vertex per mesh) that
>> > define the closest distance between them. Or the two triangles would be
>> > fine
>> > I guess.
>> >
>> > However I'm not sure how to search for this in CGAL's documentation, I'm
>> > sure that this is doable with some existing tool (probably based on a 3d
>> > distance field and/or AABBs). Could I please get a hint (keywords/link)
>> > on
>> > what to look for?
>> >
>> > I've already implemented a collision detection with CGAL to find the
>> > triangle-triangle intersection in a triangle-soup, using AABB-trees. I
>> > guess
>> > that I should be somehow close to this, although now a simple soup with
>> > all
>> > me object-triangles wouldn't do the job.
>> >
>> > Best,
>> > dimitris
>>
>> --
>> You are currently subscribed to cgal-discuss.
>> To unsubscribe or access the archives, go to
>> https://sympa.inria.fr/sympa/info/cgal-discuss
>>
>>
>