RigiComp is a collection of functions for combinatorial rigidity theory. In particular it contains commands for constructing rigid graphs, testing rigidity and computing the number of realizations for minimally rigid graphs. The package runs in Mathematica
The paper presents the application of computational tools in design and analysis of integrally tensi...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
SNAP(Symbolic Numeric Algebra for Polynomials) Package for Mathematica is a Mathematica package whic...
This piece of python code provides functionality for computing the number of complex realizations of...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
Rigidity theory is a body of mathematics developed to aid in designing structures for example scaffo...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, ...
Our goal is to characterize necessary and sufficient conditions for the universal rigidity of bipart...
This dataset contains examples of graphs comparing rigidity concepts for generic bar-joint framework...
These files contain implementations of the main algorithm of Capco, Gallet, Grasegger, Koutschan, L...
Determining the rigidity, or global rigidity, of a given framework is NP-hard. This chapter consider...
This data set collects all 4-regular Ramanujan graphs with at most 16 vertices grouped by their rigi...
INST: L_200The thesis contains results about minimal rigidity, minimal global rigidity, redundant ri...
The rigidity or flexibilty of a skeletal structure might be investigated by asking questions about i...
The paper presents the application of computational tools in design and analysis of integrally tensi...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
SNAP(Symbolic Numeric Algebra for Polynomials) Package for Mathematica is a Mathematica package whic...
This piece of python code provides functionality for computing the number of complex realizations of...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
Rigidity theory is a body of mathematics developed to aid in designing structures for example scaffo...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, ...
Our goal is to characterize necessary and sufficient conditions for the universal rigidity of bipart...
This dataset contains examples of graphs comparing rigidity concepts for generic bar-joint framework...
These files contain implementations of the main algorithm of Capco, Gallet, Grasegger, Koutschan, L...
Determining the rigidity, or global rigidity, of a given framework is NP-hard. This chapter consider...
This data set collects all 4-regular Ramanujan graphs with at most 16 vertices grouped by their rigi...
INST: L_200The thesis contains results about minimal rigidity, minimal global rigidity, redundant ri...
The rigidity or flexibilty of a skeletal structure might be investigated by asking questions about i...
The paper presents the application of computational tools in design and analysis of integrally tensi...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
SNAP(Symbolic Numeric Algebra for Polynomials) Package for Mathematica is a Mathematica package whic...
DOI
Add to ORKG