Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
From MaRDI portal
Publication:1632383
DOI10.1016/j.cagd.2015.07.001zbMath1417.65103arXiv1507.01158OpenAlexW2963426097MaRDI QIDQ1632383
Publication date: 14 December 2018
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01158
Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
- On the SPANNING \(k\)-TREE problem
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Sparse hypergraphs and pebble game algorithms
- An algorithm for two-dimensional rigidity percolation: The pebble game
- The number of embeddings of minimally rigid graphs
- Optimized parametrization of systems of incidences between rigid bodies
- Characterizing graphs with convex and connected Cayley configuration spaces
- Pebble game algorithms and sparse graphs
- On graphs and rigidity of plane skeletal structures
- Algorithm 951
- RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS
- WELL-FORMED SYSTEMS OF POINT INCIDENCES FOR RESOLVING COLLECTIONS OF RIGID BODIES
- The Algebraic Geometry of Motions of Bar-and-Body Frameworks
- On Generic Rigidity in the Plane
- The Rigidity of Graphs
- Finite subdivision rules
- Geometry Expressions: A Constraint Based Interactive Symbolic Geometry System
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Decomposition plans for geometric constraint problems. II: New algorithms
