Solving systems of 3D geometric constraints with non-rigid clusters

Authors:
Hilderick A. Van Der Meiden;Willem F. Bronsvoort
Affiliations:
Delft University of Technology, Delft, The Netherlands;Delft University of Technology, Delft, The Netherlands
Venue:
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
Year:
2008

Citing 5
Cited 0

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A systematic framework for solving geometric constraints analytically

Journal of Symbolic Computation
Decomposition plans for geometric constraint problems, part II: new algorithms

Journal of Symbolic Computation
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

Computer-Aided Design
Geometric constraints within feature hierarchies

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new constructive solving algorithm for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large constraint systems, and incrementally handle changes to a system, but can so far solve only a limited class of problems. The new solving algorithm extends the class of problems that can be solved, while retaining the advantages of the cluster rewriting approach. It rewrites a system of constraints to clusters with various internal degrees of freedom. Whereas previous constructive solvers only determined rigid clusters, we also determine two types of non-rigid clusters. This allows us to solve many additional problems that cannot be decomposed into rigid clusters, without resorting to expensive algebraic solving methods.