Abstract
We give a theorem which is of significance with respect to the existence of fast algebraic methods for the solution of planar CAD diagrams. By an algebraic method we mean a solution scheme for a family of generically dimensioned graphs which rests on the usual operations of arithmetic together with arbitrary root extraction. The result establishes the non-existence of any such algebraic method whenever the family includes an induced planar graph which is 3-connected.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asimow, L., Roth, B.: The Rigidity of Graphs. Trans. Amer. Math. Soc. 245, 279–289 (1978)
Bouma, W., Fudos, I., Hoffmann, C., Cai, J., Paige, R.: A geometric constraint solver. Computer Aided Design 27, 487–501 (1995)
Diestel, R.: Graph Theory. Springer, Heidelberg (1997)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms. Springer, Heidelberg (1992)
Gao, X.-S., Chou, S.-C.: Solving geometric constraint systems I & II. J. CAD (to appear)
Hodge, W.V.D., Pedoe, D.: Methods of Algebraic Geometry, vol. 2. Cambridge University Press, Cambridge (1952)
Laman, G.: On graphs and the rigidity of plane skeletal structures. J. Engineering Mathematics 4, 331–340 (1970)
Light, R., Gossard, D.: Modification of geometric models through variational constraints. Computer Aided Design 14, 209 (1982)
Owen, J.C.: Algebraic solution for geometry from dimensional constraints. In: ACM Symposium on Foundations in Solid Modeling, Austin, Texas, pp. 397–407 (1991)
Owen, J.C., Power, S.C.: Generic 3-connected planar constraint systems are not soluble by radicals
Stewart, I.: Galois Theory. Chapman and Hall, Boca Raton (1973)
Tutte, W.T.: Graph Theory. Addison-Wesley, Reading (1984)
Whiteley, W.: Matroid Applications. In: Encyclodedia of Mathematics and its applications, vol. 40, pp. 1–51 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Owen, J.C., Power, S.C. (2004). The Nonsolvability by Radicals of Generic 3-connected Planar Graphs. In: Winkler, F. (eds) Automated Deduction in Geometry. ADG 2002. Lecture Notes in Computer Science(), vol 2930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24616-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24616-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20927-0
Online ISBN: 978-3-540-24616-9
eBook Packages: Springer Book Archive