Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Re: How to find the minimum distance from an arbitrary point to a curve

Subject: CGAL users discussion list

List archive

[cgal-discuss] Re: How to find the minimum distance from an arbitrary point to a curve


Chronological Thread 
  • From: Tapadi <>
  • To:
  • Subject: [cgal-discuss] Re: How to find the minimum distance from an arbitrary point to a curve
  • Date: Sun, 10 Mar 2013 05:18:18 -0700 (PDT)

Last solution: there is a demo for doing what you need on Wordpress website.
The source will tell you about how to do the job.

The link to the wordpress article talking about it:
http://algorithmist.wordpress.com/2008/08/01/closest-point-on-bezier-preview/

The link to a screenshot, the demo and the source code:
http://algorithmist.wordpress.com/2009/02/02/degrafa-closest-point-on-quad-bezier/

However, I am myself still not satisfied with this reference since I am sure
that this can be done using CGAL. I keep searching how.

Best regards,
Hugo Loi
PhD student at Inria - Maverick team
http://maverick.inria.fr/



--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/How-to-find-the-minimum-distance-from-an-arbitrary-point-to-a-curve-tp4656534p4656885.html
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.18.

Top of Page