Abstract
Some properties of inscribed polygons, i.e., such plane polygons whose vertices lie on a circle, are investigated. Given an inscribed polygon with the lengths of its sides, we explore the area and radius of its circumcircle. We start with a triangle and a quadrangle and then we will explore the case of a pentagon. All the computations are based on results of commutative algebra especially on Gröbner bases method and elimination of variables in a given ideal.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Berger, M.: Geometry I. Springer, Heidelberg (1987)
Blaschke, W.: Kreis und Kugel. Walter de Gruyter & Co., Berlin (1956)
Chou, S.-C.: Mechanical Geometry Theorem Proving. D. Reidel Publishing Company, Dordrecht (1987)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer, New York (1997)
Coxeter, H.S.M., Greitzer, S.L.: Geometry Revisited, Toronto New York (1967)
Dörrie, B.H.: Triumph der Mathematik. Breslau (1933)
Kowalewski, G.: Einfürung in die Determinantentheorie. Veit & Comp., Leipzig (1909)
Pak, I.: The Area of Cyclic Polygons: Recent Progress on Robbins’ Conjectures. Mini Survey, 5 pages to appear in Adv. Applied Math (special issue in memory of David Robbins)
Rashid, M.A., Ajibade, A.O.: Two Conditions for a Quadrilateral to be Cyclic Expressed in Terms of the Lengths of Its Sides. Int. J. Math. Educ. Sci. Techn. 34(5), 739–742 (2003)
Recio, T., Sterk, H., Vélez, M.P.: Project 1. Automatic Geometry Theorem Proving. In: Some Tapas of Computer Algebra. In: Cohen, A., Cuipers, H., Sterk, H. (eds.) Algorithms and Computations in Mathematics, vol. 4, pp. 276–296. Springer, Heidelberg (1998)
Rédey, L., Nagy, B.S.Z.: Eine Verallgemeinerung der Inhaltsformel von Heron. Publ. Math. Debrecen 1, 42–50 (1949)
Robbins, D.P.: Areas of Polygons Inscribed in a Circle. Discrete Comput. Geom. 12, 223–236 (1994)
Sadov, S.: Sadov’s Cubic Analog of Ptolemy’s Theorem, http://www.math.rutgers.edu/~zeilberg/mamarim/mamarinhtml/sad
Schreiber, P.: On the Existence and Constructibility of Inscribed Polygons. Beiträge zur Algebra und Geometrie 34, 195–199 (1993)
Staudt, C.R.: Über die Inhalte der Polygone und Polyeder. Journal für die reine und angewandte Mathematik 24, 252–256 (1842)
Svrtan, D., Veljan, D., Volenec, V.: Geometry of Pentagons: From Gauss to Robbins, http://arxiv.org/abs/math/0403503
Wang, D.: Gröbner Bases Applied to Geometric Theorem Proving and Discovering. In: Buchberger, B., Winkler, F. (eds.) Gröbner Bases and Applications, pp. 281–301. Cambridge University Press, Cambridge (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pech, P. (2006). Computations of the Area and Radius of Cyclic Polygons Given by the Lengths of Sides. In: Hong, H., Wang, D. (eds) Automated Deduction in Geometry. ADG 2004. Lecture Notes in Computer Science(), vol 3763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11615798_4
Download citation
DOI: https://doi.org/10.1007/11615798_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31332-8
Online ISBN: 978-3-540-31363-2
eBook Packages: Computer ScienceComputer Science (R0)