Algorithms for detecting dependencies and rigid subsystems for CAD
From MaRDI portal
Publication:1634821
DOI10.1016/j.cagd.2016.06.001zbMath1418.68229arXiv1306.1572OpenAlexW2963244691MaRDI QIDQ1634821
Jessica Sidman, Louis Theran, Xilin Yu, Audrey St. John, Helena Kleinschmidt, James Farre, Stephanie Stark
Publication date: 18 December 2018
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.1572
Computer science aspects of computer-aided design (68U07) Combinatorial aspects of matroids and geometric lattices (05B35) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Uses Software
Cites Work
- Body-and-cad geometric constraint systems
- Sparsity-certifying graph decompositions
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Multilinear Cayley factorization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Pebble game algorithms and sparse graphs
- On graphs and rigidity of plane skeletal structures
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Characterizing generic global rigidity
- A family of exceptional Stewart-Gough mechanisms of genus 7
- The Algebraic Geometry of Motions of Bar-and-Body Frameworks
- The Union of Matroids and the Rigidity of Frameworks
- Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
- Algorithms in invariant theory
- Unnamed Item
- Unnamed Item
- Unnamed Item