Corpus ID: 124953494

Special positions of body-and-cad frameworks

@article{Farre2013SpecialPO,
  title={Special positions of body-and-cad frameworks},
  author={James Farre and Audrey St. John and Jessica Sidman and Louis Theran},
  journal={ArXiv},
  year={2013},
  volume={abs/1306.1572}
}
A recent result provides a combinatorial characterization of the generic rigidity for the majority of Computer Aided Design (CAD) structures. However, an algorithm based on this result will incorrectly classify a design as well-constrained if it is in a special (non-generic) position allowing an internal motion. Since, in practice, CAD users often rely on highly organized structural elements and design patterns which may exhibit this non-generic behavior, we seek an approach to determine… Expand
An Inductive Construction of Rigid Panel-Hinge Graphs and Their Applications to Form Design
TLDR
Two new approaches are developed that the method inductively generates non-generic rigid panel-hinge frameworks consisting of orthogonal panels based on fractal geometry coupled with space-filling convex polyhedron as a construction unit. Expand
Hong Kong AN INDUCTIVE CONSTRUCTION OF MINIMALLY RIGID PANEL-HINGE GRAPHS AND APPLICATION TO DESIGN FORM
A panel-hinge framework is a structure composed of rigid panels connected by hinges. It was recently proved that for a so-called generic position, the rigidity of panel-hinge frameworks can be testedExpand
Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems
TLDR
The combinatorial characterization of pinned subspace-incidence systems that are minimally rigid, with H being a non-uniform hypergraph and pins in X being subspaces with arbitrary dimension is extended, enabling application to a much larger class of dictionary learning problems. Expand

References

SHOWING 1-10 OF 33 REFERENCES
Combinatorics and the rigidity of CAD systems
TLDR
This combinatorial approach provides the theoretical basis for the development of deterministic algorithms (that will not depend on numerical methods) for analyzing the rigidity of body-and-cad frameworks. Expand
Body-and-cad geometric constraint systems
TLDR
A new, necessary but not sufficient, counting condition for minimal rigidity of body-and-cad structures: nested sparsity is identified, a slight generalization of the well-known sparsity condition of Maxwell. Expand
The algebraic geometry of motions of bar-and-body frameworks
This paper generalizes and extends previous results on bar-and-joint frameworks to bar-and-body frameworks: structures formed by rigid bodies in space linked by rigid bars and universal joints. For aExpand
Rigid components in fixed-lattice and cone frameworks
TLDR
If the order of rotation is part of the input, this work gives an O(n^4) algorithm for deciding rigidity; in the case where the rotation's order is 3, a more specialized algorithm solves all the fundamental algorithmic rigidity problems in O( n^2) time. Expand
The Union of Matroids and the Rigidity of Frameworks
  • W. Whiteley
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 1988
TLDR
These techniques are used to characterize the graphs of infinitesimally rigid frameworks on other surfaces, such as the flat torus, the cylinder, cones, etc., using matroid unions of cycle and bicycle matroids of the graph. Expand
Parallel manipulators. Part 2 : Theory. Singular configurations and Grassmann geometry
Parallel manipulators have a specific mechanical architecture where all the links are connected both at the basis and at the gripper of the robot. By changing the lengths of these links we are ableExpand
Rigidity of multi-graphs. I. Linking rigid bodies in n-space
  • T. Tay
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1984
TLDR
It is shown that a multi-graph can be realized as a rigid linkage of rigid bodies in n-space if and only if it contains n(n + 1)2 edge disjoint spanning trees. Expand
Detecting Singularities of Stewart Platforms
A Stewart platform, also known as a hexapod positioner, is a parallel manipulator using an octahedral assembly of struts. There are six independently actuated legs, whose lengths determine theExpand
Multilinear Cayley Factorization
  • N. White
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1991
TLDR
The main result of this paper is an algorithm which solves the Cayley factorization problem in the important special case that P is multilinear. Expand
Sparsity-certifying Graph Decompositions
TLDR
The authors' colored pebbles generalize and strengthen the previous results of Lee and Streinu and give a new proof of the Tutte-Nash-Williams characterization of arboricity, and present a new decomposition that certifies sparsity based on the (k, ℓ)-pebble game with colors. Expand
...
1
2
3
4
...