Laman graphs are generically bearing rigid in arbitrary dimensions
-
Altmetric Citations
Zhao, Shiyu; Sun, Zhiyong; Zelazo, Daniel; Trinh, Minh H; Ahn, Hyo-Sung
Description
This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the network. A new notion termed generic bearing rigidity is defined for graphs. If the underlying graph of a network is generically bearing rigid, then the network is bearing rigid for almost all configurations; otherwise, the network is not bearing rigid for any...[Show more]
Collections | ANU Research Publications |
---|---|
Date published: | 2017 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/204530 |
Book Title: | 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017 |
DOI: | 10.1109/CDC.2017.8264151 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Zhao_Laman_graphs_are_generically_2017.pdf | 542.22 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator