Back to Search
Start Over
Algorithm 1012
- Source :
- ACM Transactions on Mathematical Software. 46:1-20
- Publication Year :
- 2020
- Publisher :
- Association for Computing Machinery (ACM), 2020.
-
Abstract
- 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.
- Subjects :
- Clustering high-dimensional data
020203 distributed computing
Delaunay triangulation
Computer science
Fortran
Applied Mathematics
010103 numerical & computational mathematics
02 engineering and technology
01 natural sciences
Exponential growth
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
0202 electrical engineering, electronic engineering, information engineering
0101 mathematics
Sensitivity analyses
Algorithm
computer
Software
MathematicsofComputing_DISCRETEMATHEMATICS
ComputingMethodologies_COMPUTERGRAPHICS
Interpolation
computer.programming_language
Subjects
Details
- ISSN :
- 15577295 and 00983500
- Volume :
- 46
- Database :
- OpenAIRE
- Journal :
- ACM Transactions on Mathematical Software
- Accession number :
- edsair.doi...........5dede836fc308e0a4de6c998c02f9662