Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] about query k nearest neighbor point in Delaunay triangulation

Subject: CGAL users discussion list

List archive

[cgal-discuss] about query k nearest neighbor point in Delaunay triangulation


Chronological Thread 
  • From: Query Cgal <>
  • To:
  • Subject: [cgal-discuss] about query k nearest neighbor point in Delaunay triangulation
  • Date: Sat, 28 Feb 2009 06:04:31 -0800 (PST)
  • Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com.hk; h=Message-ID:X-YMail-OSG:Received:X-Mailer:Date:From:Reply-To:Subject:To:MIME-Version:Content-Type; b=5MfhUbAbL49t94ULal9dlzG0W4QUevSSGeYArwCSouHvD+OMy/Oc/zK994BYTzmWsWo7fpG2wyvv5PnVPk5ILITAMMUfszBV9/RGiEInkoT6eAPEgbOadpoW8fRWcsu5W2RQnADjXDv1IhCEO+p2o8gGmELHx2I0wlYRItHqQpk=;

Hi.

I have found the function below in CGAL manual

Dt.nearest_neighbor(Point p);

which return a point which is inside the triangulation Dt and which is nearest to p

If we want to have the functionality which takes a point p and return a point k which is the fifth nearest neighbor of p and which is inside the triangulation, do we need to implement that ourself? It seems that from the manual, there is no function that support the above functionality.

Thank you








Yahoo!香港提供網上安全攻略,教你如何防範黑客!了解更多

  • [cgal-discuss] about query k nearest neighbor point in Delaunay triangulation, Query Cgal, 02/28/2009

Archive powered by MHonArc 2.6.16.

Top of Page