A Geometric Constraint Solver with Decomposable Constraint Set

Date issued

2001

Journal Title

Journal ISSN

Volume Title

Publisher

University of West Bohemia

Abstract

In the paper, a new constructive approach to solving geometric constraints in 2D space is presented. The main step of the algorithm is pre-processing, which transforms both, geometric elements and geometric constraints, into simpler forms, and adds redundant constraints of distances and angles by solving triangles and determining sums and differences of adjacent angles. A wide variety of well-constrained problems can then be solved by a simple technique of local propagation, and over-constrained scenes and input data contradictory to some well-known mathematical theorems can also be detected in the same phase. Only with under-constrained problems and some special well-constrained cases, an additional step of merging clusters and/or geometrical relaxation is required.

Description

Subject(s)

geometrické modelování, geometrické vazby, design založený na vazbách

Citation

WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 222-229.