Scattered Data Approximation Based on Delaunay Tessellation |
Contents
Delaunay Tessellation | 7 |
R Franke and G M Nielson Surface Approximation With Imposed Conditions Surfaces | 8 |
Stochastic Model | 24 |
2 other sections not shown
Common terms and phrases
added addition affine transformation algorithm approximation approximation scheme assume Assumption average bound boundary called cell Chapter circ Circumcircle circumsphere claim complexity connect Consider construct Contour Surface contradiction cost d-dimensional defined Definition Delaunay Neighbor Delaunay Tessellation Delaunay Triangulation deletion denote dimensional distribution dual Edge efficiency elements empty facet equidistant error bound estimate Example exists fact fall Field of density function give Given hence higher-dimensional holds hypersphere includes increase independent inside Interpolation Intuitively Lebesgue measurable Lemma Library lies Link maximum means measured Methods namely nodes in Sn Note number of nodes opposite side passes points Poisson Field possible problems proof properties radius refer reliability respectively restrict satisfies scattered shows simplex simplices space stochastic model structure Suppose tetrahedron Theorem thesis values varies vertices Voronoi Neighbors Voronoi Region Voronoi Vertex XdxT