Sciweavers

15 search results - page 1 / 3
» Algorithms for Identifying Rigid Subsystems in Geometric Con...
Sort
View
IJCAI
2003
13 years 6 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
13 years 10 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
FAC
2010
105views more  FAC 2010»
13 years 3 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
CAD
2010
Springer
13 years 5 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
IVC
2007
131views more  IVC 2007»
13 years 4 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...