A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
- 1 March 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (3) , 288-292
- https://doi.org/10.1109/tc.1977.1674822
Abstract
A method for the sequential mapping of points in a high-dimensional space onto a plane is presented. Whenever a new point is mapped, its distgnces to two points previously mapped are exactly preserved. On the resulting map, 2M -3 of the original distances can be exactly preserved. The mapping is based on the distances of a minimal spanning tree constructed from the points. All of the distances on the minimal spanning tree are exactly preserved.Keywords
This publication has 11 references indexed in Scilit:
- Distinguishing vegetation land covers using hyperspectral imageryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A Heuristic Relaxation Method for Nonlinear Mapping in Cluster AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1973
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972
- Application of game tree searching techniques to sequential pattern recognitionCommunications of the ACM, 1971
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Computer Analysis of Protein EvolutionScientific American, 1969
- A Nonlinear Mapping for Data Structure AnalysisIEEE Transactions on Computers, 1969
- Minimum Spanning Trees and Single Linkage Cluster AnalysisJournal of the Royal Statistical Society Series C: Applied Statistics, 1969
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936