Abstract
Interpolating unstructured data using barycentric coordinates becomes infeasible at high dimensions due to the prohibitive memory requirements of building a Delaunay triangulation. We present a new algorithm to construct ad-hoc simplices that are empirically guaranteed to contain the target coordinates, based on a nearest neighbor heuristic and an iterative dimensionality reduction through projection. We use these simplices to interpolate the astrophysical cooling function and show that this new approach produces good results with just a fraction of the previously required memory.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.