By Topic

Uniquely representing point patterns with minimal information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. H. Levine ; Dept. of Civil & Environ. Eng., Tufts Univ., Medford, MA, USA ; J. G. Kreifeldt

As an alternative to coordinate locations, patterns of points can be represented using interpoint distances. In certain applications, such as dimensioning and multidimensional scaling, interpoint distances have traditionally been used. In other applications, such as radar location, interpoint distance information is readily obtained, This paper utilizes kinematics, rigidity theory, and graph algorithms to determine the theoretical minimum interpoint distance information adequate for uniquely representing point patterns. It is shown that this theoretical minimum is comparable to that amount of information required by coordinate descriptions

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:24 ,  Issue: 6 )