Algorithm 1012 Article Swipe

PDF

Related Concepts

delaunay triangulation bowyer–watson algorithm interpolation (computer graphics) pitteway triangulation minimum-weight triangulation computer science triangulation constrained delaunay triangulation algorithm mathematics ruppert's algorithm computer graphics (images) geometry animation

Tyler H. Chang , Layne T. Watson , Thomas Lux , Ali R. Butt , Kirk W. Cameron , Yili Hong ·

YOU? · · 2020 · Open Access · · DOI: https://doi.org/10.1145/3422818 · OA: W3104522718

DELAUNAYSPARSE contains both serial and parallel codes written in Fortran 2003 (with OpenMP) for performing medium- to high-dimensional interpolation via the Delaunay triangulation. To accommodate the exponential growth in the size of the Delaunay triangulation in high dimensions, DELAUNAYSPARSE computes only a sparse subset of the complete Delaunay triangulation, as necessary for performing interpolation at the user specified points. This article includes algorithm and implementation details, complexity and sensitivity analyses, usage information, and a brief performance study.