This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Solving Geometric Constraints By Homotopy
March 1996 (vol. 2 no. 1)
pp. 28-34

Abstract—Numerous methods have been proposed in order to solve geometric constraints, all of them having their own advantages and drawbacks. In this article, we propose an enhancement of the classical numerical methods, which are, up to now the only ones that apply to the general case.

[1] S. Ait-Aoudia,R. Jegou, and D. Michelucci,"Reduction of Constraint Systems," Compugraphic, pp. 83-92,Alvor, Portugal, 1993. Also available at http://www.emse.fr/~micheluc/.
[2] E.L. Allgower and K. Georg,"Continuation and Path Following," Acta Numerica, pp. 1-64, 1993.
[3] W. Bouma,I. Fudos,C. Hoffmann,J. Cai, and R. Paige,"A geometric Constraint Solver," Technical Report CSD-TR-93-054, Dept. of Computer Science, Purdue Univ., Aug. 1993.
[4] A. Borning,"The Programming Language Aspects of Thinglab, a Constraint Oriented Simulation Laboratory," ACM Trans. Programming Languages and Systems, vol. 3, pp. 353-387, Oct. 1981.
[5] B. Bruderlin,"Constructing Three-Dimensional Geometric Objects Defined by Constraints," Interactive 3D Graphics, pp. 111-129, Oct. 1986.
[6] M. Buthion,"Un Programme Qui Résout Formellement Des Problèmes de Constructions Géométriques," RAIRO Informatique, vol. 3, no. 4, pp. 353-387, Oct. 1979.
[7] S.C. Chou,W.F. Schelter, and J.G. Yang,"Characteristic Sets and Grobner Bases in Geometry Theorem Proving," Workshop Computer Aided Geometric Reasoning, pp. 29-56,INRIA, France, June 1987.
[8] D.P. Dobkin,S.V.F. Levy,W.P. Thurston, and A. Wilks,"Contour Tracing by Piecewise Linear Approximations," ACM Trans. Graphics, vol. 9, no. 4, pp. 389-423, Oct. 1990.
[9] L.W. Ericson and C.K. Yap,"The Design of Linetool a Geometric Editor," Symp. Computational Geometry, pp. 83-92, 1988.
[10] B. Hendrickson,"Conditions for Unique Realizations," SIAM J. Computing, vol. 21, no. 1, pp. 65-84, Feb. 1992.
[11] C.M. Hoffmann,"A Dimensionality Paradigm for surface interrogations," Computer Aided Geometric Design, vol. 7, pp. 517-532, 1990.
[12] K. Kondo,"Algebraic method for manipulation of dimensional relationships in geometric models," Computer Aided Design, vol. 24, no. 3, pp. 141-147, Mar. 1992.
[13] D. Lazard,"Systems of Algebraic Equations: Algorithms and Complexity," Technical Report LITP 92.20, LITP, UniversitéParis VI, VII, CNRS, Mar. 1992.
[14] T.Y Li and Xiaoshen Wang,"Solving Real Polynomial Systems with Real Homotopies," Math. of Computation, vol. 60, no. 202, pp. 669-680, 1993.
[15] R. Light,V. Lin, and D.C. Gossard,"Variational Geometry in CAD," Computer Graphics, vol. 15, no. 3, pp. 171-177, Aug. 1981.
[16] A.P. Morgan,Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems.Englewood Cliffs, N.J.: Prentice-Hall, 1983.
[17] A.P. Morgan,"A Transformation to Avoid Solutions at Infinity for Polynomial Systems," Applied Math. and Computation, vol. 18, pp. 77-86, 1986.
[18] G. Nelson,"Juno, a Constraint-Based Graphic System," Proc. ACM Siggraph Conf. 1985.
[19] J.C. Owen,"Algebraic Solution for Geometry from Dimensional Constraints," Proc. Symp. on Solid Modeling Foundations and CAD/CAM Applications, pp. 397-407, 1991.
[20] N.M. Patrikalakis,"Surface-to-Surface Intersections," IEEE Computer Graphics and Applications, vol. 13, no. 1, pp. 89-95, Jan. 1992.
[21] H.O. Peitgen and P.H. Richter,The Beauty of Fractals, Images of Complex Dynamical Systems. Springer-Verlag, 1986.
[22] P. Schramm,"Intersection Problems of Parametric Surfaces in cagd," Computing, vol. 53, pp. 355-364, 1994.
[23] I.E. Sutherland,"Sketchpad, a man machine graphical communication system," AFIPS, Spring Joint Computer Conf., pp. 329-346,Detroit, Mich., May 1963.
[24] A. Verroust,"Etudes de problémes liésàla définition, la visualisation et l'animation d'objets complexes en informatique graphique," PhD thesis, Univ. de Paris Sud, Centre d'Orsay, 1990.
[25] A. Verroust,F. Schonek, and D. Roller,"Rule Oriented Method for Parametrized Computer Aided Design," Computer Aided Design, vol. 24, no. 3, pp. 531-540, Oct. 1992.
[26] J. Verschelde,P. Verlinden, and R. Cools,"Homotopies Exploiting Newtoni Polytopes for Solving Sparse Polynomial Systems," SIAM J. Numerical Analysis, 1993.
[27] C.W. Wampler,A.P. Morgan, and A.J. Sommese,"Numerical Continuation Methods for Solving Polynomial Systems Arising in Kinematics.," ASME J. on Design, vol. 112, pp. 59-68, 1990.
[28] F. Winkler,"Algorithms in Polynomial Ideal Theory and Geometry," Second Austrian-Hungarian Informatics Conf.,Retzhof Austria, Sept. 1988.
[29] J.C. Yakoubsohn,"An Universal Constant for the Convergence to the Newton Method and Application to the Classical Homotopy Method," Numerical Algorithms, 1995.

Index Terms:
Geometric constraints, numerical resolution, homotopy, continuation methods, constaints-based modeling.
Citation:
Hervé Lamure, Dominique Michelucci, "Solving Geometric Constraints By Homotopy," IEEE Transactions on Visualization and Computer Graphics, vol. 2, no. 1, pp. 28-34, March 1996, doi:10.1109/2945.489384
Usage of this product signifies your acceptance of the Terms of Use.