Geometric reasoning in the analysis of assemblies and mechanisms

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This work proposes Divide-and-Conquer techniques applied to local Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) subproblems to identify strongly constrained clusters of geometric entities. Cluster identification can be related to identifying short cycles in the Spatial Constraint graph for the GCS/SF problem. Their preprocessing uses the aforementioned Algebraic Geometry and Group theoretical techniques on the local GCS/SF problems that correspond to these cycles. Besides improving the efficiency of the solution approach, the Divide-and-Conquer techniques capture the physical essence of the problem. This is illustrated by applying tbe discussed techniques to the analysis of the degrees ot freedom of mechanisms.

Original languageEnglish (US)
Title of host publicationComputer Integrated Concurrent Design Conference
EditorsR. Gadh
Number of pages14
Edition2 Pt 2
StatePublished - 1995
EventProceedings of the 1995 ASME Design Engineering Technical Conference - Boston, MA, USA
Duration: Sep 17 1995Sep 20 1995


OtherProceedings of the 1995 ASME Design Engineering Technical Conference
CityBoston, MA, USA

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Geometric reasoning in the analysis of assemblies and mechanisms'. Together they form a unique fingerprint.

Cite this