Article ID: | iaor19961920 |
Country: | Croatia |
Volume: | 3 |
Issue: | 4 |
Start Page Number: | 229 |
End Page Number: | 244 |
Publication Date: | Dec 1995 |
Journal: | Journal of Computer and Systems Sciences International |
Authors: | Zalik Borut, Guid Nikola |
Keywords: | graphs |
A 2D constraint-based geometric modelling system is considered in the paper. Constraints are solved by local propagation of known states. The weakness of local propagation (it cannot solve cyclic constraints) is explained by an example. A biconnected constraint description graph is used to support local propagation. As a result of constraint solving an acyclic constraint description graph is obtained and it can be observed as a parametric description of a geometric object. The acyclic constraint description graph stores the sequence of applying constraints for generation of instances. It is shown that the time complexity of the algorithm for generation of an instance is