Delaunay Triangulation of a set of points and the identification of a triangle for a target point

The large circles in the plot below indicate the positions in the triangulated neighbourhood of points that comprise the optimum points for linear interpolation for the target point indicated by the single point not attached to any vertex (i.e. the point that lies in the Big Circle triangle).

This website uses cookies. By using the website, you agree with storing cookies on your computer. Also you acknowledge that you have read and understand our Privacy Policy. If you do not agree leave the website.More information about cookies
  • kvalobs/kvoss/system/qc2/requirements/nordklim/qc2algorithms/delaunay.txt
  • Last modified: 2022-05-31 09:29:32
  • (external edit)