CGAL users discussion list

[sushil <>]

If you want associate info (temperature in you case) to your points, you 
can have a look at this example:
http://doc.cgal.org/latest/Triangulation_3/index.html#Triangulation_3UsinganIteratorOverPairs

To get the neighbor vertices without inserting a point, you need to 
first locate the point in the triangulation:
http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Triangulation__3.html#adae217a7db65ecdc2405658b661ccf0a

and you can get the conflict zone using find_conflicts:
http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Delaunay__triangulation__3.html#a24b378be12e92562ec95b65a5fa5516f

If you insert the points, then you can use the function adjacent_vertices:
http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Triangulation__3.html#ae6f24355946f91b3618188da06d8047e

Thanks, sebastien for your reply. But i want to know what is done after
finding neighbours to the query point. I suppose again the triangulation is
done with these 16 neighbour points. i want to know how to get the cells of
this triangulation containing 16 points?





--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/finding-cells-made-by-neighbour-points-of-a-query-point-inserted-in-delaunay-triangulation-tp4658835p4658837.html
Sent from the cgal-discuss mailing list archive at Nabble.com.