Dealing with redundancy and inconsistency in constructive geometric constraint solving

Authors:
David Podgorelec;Borut alik;Vid Domiter
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia
Venue:
Advances in Engineering Software
Year:
2008

Citing 10
Cited 1

Wu's method and its application to perspective viewing

Artificial Intelligence - Special issue on geometric reasoning
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)
Decomposition plans for geometric constraint systems, part I: performance measures for CAD

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

Journal of Symbolic Computation
Solving Geometric Constraints By Homotopy

IEEE Transactions on Visualization and Computer Graphics
A hybrid approach to geometric constraint solving with graph analysis and reduction

Advances in Engineering Software
Numerical decomposition of geometric constraints

Proceedings of the 2005 ACM symposium on Solid and physical modeling
Algorithms for identifying rigid subsystems in geometric constraint systems

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Geometric constraint solving: The witness configuration method

Computer-Aided Design

A 2D geometric constraint solver using a graph reduction method

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. However, all these methods are based on the assumption that structural rigidity automatically assures solvability. In this paper, we show that this assumption fails in numerous, even the most basic, configurations. We introduce several simple but efficient rules aimed to additionally analyse solvability in such cases. Another novelty addresses conditional constraints between three or more geometric parts, rules for their simplification and a redundancy check. All these functionalities are built into our original 2D geometric constraint solver, based on concepts of rigid clusters and constrained-angle (CA) sets.