Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in "Distance geometry: with applications to molecular conformation and sensor networks" edited by Mucherino et al. a

Scientific paper

A configuration p in r-dimensional Euclidean space is a finite collection of labeled points p^1,p^2,...,p^n in R^r that affinely span R^r. Each configuration p defines a Euclidean distance matrix D_p = (d_ij) = (||p^i-p^j||^2), where ||.|| denotes the Euclidean norm. A fundamental problem in distance geometry is to find out whether or not, a given proper subset of the entries of D_p suffices to uniquely determine the entire matrix D_p. This problem is known as the universal rigidity problem of bar frameworks. In this chapter, we present a unified approach for the universal rigidity of bar frameworks, based on Euclidean distance matrices (EDMs), or equivalently, on projected Gram matrices. This approach makes the universal rigidity problem amenable to semi-definite programming methodology. Using this approach, we survey some recently obtained results and their proofs, emphasizing the case where the points p^1,...,p^n are in general position.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-694000

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.