Affiliation:
1. Univ. of Ioannina, Ioannina, Greece
2. Purdue Univ., West Lafayette, IN
Abstract
A graph-constructive approach to solving systems of geometric constraints capable of effeciently handling well-constrained, overconstrained, and underconstrained configurations is presented. The geometric constraint solver works in two phases: in the analysis phase the constraint graph is analyzed and a sequence of elementary construction steps is derived, and then in the construction phase the sequence of construction steps in actually carried out. The analysis phase of the algorithm is described in detail, its correctness is proved, and an efficient algorith to realized it is presented. The scope of the graph analysis is then extended by utilizing semantic information in the form of anlge derivations, and by extending the repertoire of the construction steps. Finally, the construction phase is briefly discussed.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference38 articles.
1. AHO A. V. HOPCROFT J. E. AND ULLMAN J.D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading MA. AHO A. V. HOPCROFT J. E. AND ULLMAN J.D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading MA.
2. Variation of geometries based on a geometric-reasoning method
3. On a theory of computation and complexity over the real numbers: NP-Completeness, recursive functions and universal machines;BLUM L.;Bull. Am. Math. Soc. (New Series),1989
4. A geometric constraint solver;BOUMA W.;Cornput. Aided Des.,1995
Cited by
125 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献