Russell Pflughaupt

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-93-745

, 1993

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/CSD-93-745.pdf

This report explores methods for interpolating across high-dimensional data sets. We describe and evaluate algorithms designed for problems with 100 to 10,000 points in dimensions 2 through 40. Specialized algorithms that attempt to take advantage of properties of locality are shown to be less efficient than generalized algorithms such as gift-wrapping and linear programming. In addition, this report contains an accumulation of information on the properties of high-dimensional spaces.


BibTeX citation:

@techreport{Pflughaupt:CSD-93-745,
    Author= {Pflughaupt, Russell},
    Title= {High-Dimensional Linear Data Interpolation},
    Year= {1993},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/6278.html},
    Number= {UCB/CSD-93-745},
    Abstract= {This report explores methods for interpolating across high-dimensional data sets. We describe and evaluate algorithms designed for problems with 100 to 10,000 points in dimensions 2 through 40. Specialized algorithms that attempt to take advantage of properties of locality are shown to be less efficient than generalized algorithms such as gift-wrapping and linear programming. In addition, this report contains an accumulation of information on the properties of high-dimensional spaces.},
}

EndNote citation:

%0 Report
%A Pflughaupt, Russell 
%T High-Dimensional Linear Data Interpolation
%I EECS Department, University of California, Berkeley
%D 1993
%@ UCB/CSD-93-745
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/6278.html
%F Pflughaupt:CSD-93-745