CGAL users discussion list

[Query Cgal <>]

Hi.

I have tried to search for the CGAL manual for the previous functionality that I have asked about. Hoewever, I cannot really find it.

Therefore, may I here confirm if it is that the functionality is not supported in CGAL so that I should not search the manual for that any more? Currently, I am using CGAL 3.3.1

Thank you


--- 2009年2月28日 星期六，Query Cgal <> 寫道﹕

寄件人: Query Cgal <>
主題: [cgal-discuss] about query k nearest neighbor point in Delaunay triangulation
收件人:
日期: 2009 2 28 星期六 下午 2:04

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!香港提供網上安全攻略，教你如何防範黑客!了解更多

---

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