A graph-constructive approach to solving systems of geometric constraints
- 1 April 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 16 (2) , 179-216
- https://doi.org/10.1145/248210.248223
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.Keywords
This publication has 15 references indexed in Scilit:
- CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVERInternational Journal of Computational Geometry & Applications, 1996
- On Digital NondeterminismTheory of Computing Systems, 1996
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Variation of geometries based on a geometric-reasoning methodComputer-Aided Design, 1988
- Shortest-path problems and molecular conformationDiscrete Applied Mathematics, 1988
- On combinatorial structures of line drawings of polyhedraDiscrete Applied Mathematics, 1985
- The complexity of determining a shortest cycle of even lengthComputing, 1983
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937