Transforming an under-constrained geometric constraint problem into a well-constrained one

Authors:
R. Joan-Arinyo;A. Soto-Riera;S. Vila-Marta;J. Vilaplana-Pastó
Affiliations:
Universitat Politècnica de Catalunya, Escola Tècnica Superior d'Enginyeria Industrial de Barcelona, Barcelona;Universitat Politècnica de Catalunya, Escola Tècnica Superior d'Enginyeria Industrial de Barcelona, Barcelona;Universitat Politècnica de Catalunya, Escola Tècnica Superior d'Enginyeria Industrial de Barcelona, Barcelona;Universitat Politècnica de Catalunya, Escola Tècnica Superior d'Enginyeria Industrial de Barcelona, Barcelona
Venue:
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Year:
2003

Citing 9
Cited 11

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Algebraic solution for geometry from dimensional constraints

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
A graph-constructive approach to solving systems of geometric constraints

ACM Transactions on Graphics (TOG)
Multiple-way feature conversion—opening a view

GMCAD '96 Proceedings of the fifth IFIP TC5/WG5.2 international workshop on geometric modeling in computer aided design on Product modeling for computer integrated design and manufacture
Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths

SIAM Journal on Discrete Mathematics
Decomposition plans for geometric constraint systems, part I: performance measures for CAD

Journal of Symbolic Computation
Revisiting decomposition analysis of geometric constraint graphs

Proceedings of the seventh ACM symposium on Solid modeling and applications
On the Domain of Constructive Geometric Constraint Solving Techniques

SCCG '01 Proceedings of the 17th Spring conference on Computer graphics
Symbolic and numerical techniques for constraint solving

Symbolic and numerical techniques for constraint solving

Numerical decomposition of geometric constraints

Proceedings of the 2005 ACM symposium on Solid and physical modeling
Geometric constraints solving: some tracks

Proceedings of the 2006 ACM symposium on Solid and physical modeling
Constraint solving for direct manipulation of features

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Constraint-based beautification and dimensioning of 3D polyhedral models reconstructed from 2D sketches

Computer-Aided Design
Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces

Proceedings of the 2009 ACM symposium on Applied Computing
Geometric constraint solving: The witness configuration method

Computer-Aided Design
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

Computer-Aided Design
Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph

Proceedings of the 2011 ACM Symposium on Applied Computing
Example-based procedural modelling by geometric constraint solving

Multimedia Tools and Applications
Technical note: How the Beast really moves: Cayley analysis of mechanism realization spaces using CayMos

Computer-Aided Design
Coordinate-free geometry and decomposition in geometrical constraint solving

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach for handling geometric constraint problems with under-constrained configurations. The approach works by completing the given set of constraints with constraints that can be defined either automatically or drawn from an independently given set of constraints placed on the geometries of the problem. In both cases, the resulting completed set of constraints is not over-constrained. If every well-constrained subproblem in the given under-constrained configuration is solvable, the completed constraint problem is also solvable.