Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs

Sergey Bereg. Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. Comput. Geom., 40(1):37-44, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.