Rigidity Test Using The Pebble Game Distributed Implementation
| dc.contributor.author | BOURAS, Ibrahim | |
| dc.contributor.author | Research Director: Moussaoui, Adel | |
| dc.date.accessioned | 2023-05-30T12:15:07Z | |
| dc.date.available | 2023-05-30T12:15:07Z | |
| dc.date.issued | 2016-06-10 | |
| dc.description.abstract | James Clark Maxwell wondered: counting vertices and edges in a given framework is enough to make predictions about its rigidity and fexibility? Laat in 1970 confirmed that the 24 generic bar and joint frameworks is completely combinatorial problem. Le counting is enough to decide.. The 2V-3 counting condition for 24 structures verified by the last pebble game algorithm which tracks quickly this count. Hendrickson and jacobs proposed the centralized pebble gume version in 1997. In 2014, group of researchers proposed the decentralized version in IEEE In this thesis, we the implement the asynchronous, distributed algorithm of the pebble game for testing the rigidity in 2d framework, using java threads and interprocess communicatons protocols. We have also introduced several rigidity theory applications, we will apply our algorithm on some 2d strucutres. The results obtained in this Master theisis showed that our distributed implementation is well done and worked. | en_US |
| dc.identifier.uri | http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/38992 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of M'sila | en_US |
| dc.subject | Rigidity, Flexibility, Laman graph, pebble gume algorithm. | en_US |
| dc.title | Rigidity Test Using The Pebble Game Distributed Implementation | en_US |
| dc.type | Thesis | en_US |