Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] finding cells made by neighbour points of a query point inserted in delaunay triangulation

Subject: CGAL users discussion list

List archive

[cgal-discuss] finding cells made by neighbour points of a query point inserted in delaunay triangulation


Chronological Thread 
  • From: sushil <>
  • To:
  • Subject: [cgal-discuss] finding cells made by neighbour points of a query point inserted in delaunay triangulation
  • Date: Fri, 21 Feb 2014 03:46:28 -0800 (PST)

Hello all,
I am very new to CGAL so i dont know much of it. I have 1008 3D points
containing some values at each of these points(in my example these are
temperatures), of which a delaunay triangulation T is created. Now the
triangulation consists of 6550 cells or tetrahedrons and i also got the
vertices of these cells using Cell_iterator and Cell_handle. Now i am
inserting a query point into this triangulation whose coordinates are known
and i want to get the temperature value at that point by linear
interpolation. i got 16 neighbour points to this query point. Now i want to
know that, for finding interpolation weights , again cells are formed using
these 16 neighbour points? if yes, i want to know how to get them and there
vertices. Also it would be a great help if somebody would explain me what
exactly is done after finding neighbour points of the query point to get an
interpolation.

Any help would be deeply appreciated.
sushil



--
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-tp4658835.html
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.18.

Top of Page