CGAL users discussion list

[Giles Bathgate <>]

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