This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
March 1977 (vol. 26 no. 3)
pp. 288-292
R.C.T. Lee, Institute of Applied Mathematics, National Tsing Hua University
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.
Index Terms:
Clustering analysis, distance preserving, minimal spanning tree, nonlinear mapping, principal component analysis, reference point approach, second nearest neighbor approach, tree searching.
Citation:
R.C.T. Lee, J.R. Slagle, H. Blum, "A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space," IEEE Transactions on Computers, vol. 26, no. 3, pp. 288-292, March 1977, doi:10.1109/TC.1977.1674822
Usage of this product signifies your acceptance of the Terms of Use.