ACM Home Page
Please provide us with feedback. Feedback
Body-and-cad geometric constraint systems
Full text PdfPdf (1.29 MB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Geometric constraints and reasoning track table of contents
Pages 1127-1131  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Kirk Haller  SolidWorks Corporation, Concord, MA
Audrey Lee-St. John  Mount Holyoke College, South Hadley, MA
Meera Sitharam  University of Florida, Gainesville, FL
Ileana Streinu  Smith College, Northampton, MA
Neil White  University of Florida, Gainesville, FL
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529530
What is a DOI?

ABSTRACT

Motivated by constraint-based CAD software, we develop the foundation for the rigidity theory of a very general model: the body-and-cad structure, composed of rigid bodies in 3D constrained by pairwise coincidence, angle and distance constraints. We identify 21 relevant geometric constraints and develop the corresponding infinitesimal rigidity theory for these structures. The classical body-and-bar rigidity model can be viewed as a body-and-cad structure that uses only one constraint from this new class.

As a consequence, we identify a new, necessary but not sufficient, counting condition for minimal rigidity of body-and-cad structures: nested sparsity. This is a slight generalization of the well-known sparsity condition of Maxwell.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Crapo and W. Whiteley. The statics of frameworks and movements of panel structures, a geometric introduction. Structural Topology, 6: 43--82, 1982.
 
2
J. Graver, B. Servatius, and H. Servatius. Combinatorial rigidity. Graduate Studies in Mathematics. American Mathematical Society, 1993.
 
3
G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4: 331--340, 1970.
 
4
A. Lee. Geometric Constraint Systems with Applications in CAD and Biology. PhD thesis, University of Massachusetts Amherst, May 2008.
 
5
A. Lee and I. Streinu. Pebble game algorithms and sparse graphs. Discrete Mathematics, 2007.
 
6
A. Lee, I. Streinu, and L. Theran. Graded sparse graphs and matroids. Journal of Universal Computer Science, 13(11): 1671--1679, 2007. http://arxiv.org/abs/0711.2838.
 
7
 
8
D. Michelucci and P. Schreck. Incidence constraints: a combinatorial approach. International Journal of Computational Geometry Applications, 16(5--6): 443--460, 2006.
 
9
 
10
 
11
 
12
I. Streinu and L. Theran. Sparse hypergraphs and pebble game algorithms. European Journal of Combinatorics, to appear. http://arxiv.org/abs/math/0703921.
 
13
T.-S. Tay. Rigidity of multigraphs I: linking rigid bodies in n-space. Journal of Combinatorial Theory Series, B 26: 95--112, 1984.
 
14
N. White. Grassmann-cayley algebra and robotics, 1994.
 
15
 
16
 
17
W. Whiteley. A matroid on hypergraphs, with applications in scene analysis and geometry. Discrete and Computational Geometry, 4: 75--95, 1989.
 
18
W. Whiteley. Some matroids from discrete applied geometry. In J. Bonin, J. G. Oxley, and B. Servatius, editors, Matroid Theory, volume 197 of Contemporary Mathematics, pages 171--311. American Mathematical Society, 1996.
 
19

Collaborative Colleagues:
Kirk Haller: colleagues
Audrey Lee-St. John: colleagues
Meera Sitharam: colleagues
Ileana Streinu: colleagues
Neil White: colleagues