CGAL users discussion list

[Damian Sheehy <>]

Hi Pierre,

I am also interested in this problem as I had to confront it in the past when I worked on developing meshing software. However, I am more interested in the technical details of the algorithm rather than the code.  If you have a tech report or paper that you can share I would be interested in learning about your approach.

Thank you,

Damian

On Wed, Mar 25, 2009 at 7:50 AM, Pierre Alliez <> wrote:

hi Ehsan,

I guess you would be happy to find the closest point from one query point to a triange soup ?
we are working on it these days - hopefully for the next release.

I could sent you our current implementation...


Pierre Alliez
INRIA Sophia Antipolis - Mediterranee Project-team GEOMETRICA http://www-sop.inria.fr/members/Pierre.Alliez/
Tel: +33 4 92 38 76 77
Fax: +33 4 97 15 53 95



a écrit :

Hi,
Does anybody know an efficient way to project a point_3 on a polyhedron_3 ?
Thank you,
Ehsan
 

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss