Abstract
For a given triangle there are many points associated with the triangle that lie in its interior; examples include the incenter (which can be found by the intersection of the angle bisectors) and the centroid (which can be found by the intersection of the medians). Using this point one can naturally subdivide the triangle into either three or six “daughter” triangles. We can then repeat the same process on each of the daughters and so on and so on. A natural question is after some large number of steps what does a typical nth generation daughter look like (up to similarity)? In this paper we look at this problem for both the incenter and the centroid and show that they have very distinct behavior as n gets large. We will also consider the Gergonne point and the Lemoine point.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. C. Alexander, The symbolic dynamics of pedal triangles, Math. Mag., 66 (1993), 147–158.
Imre Bárány, Alan F. Beardon and Thomas Keith Carne, Barycentric subdivision of triangles and semigroups of Möbius maps, Mathematika 43 (1996), 165–171.
Marshall Bern and David Eppstein, “Mesh generation and optimal triangulation”, in: Computing in Euclidean Geometry, Ding-Zhu Du and Frank Hwang, eds. (1992), 23–90.
Steve Butler, The lost daughters of Gergonne, Forum Geometricorum, 9 (2009), 19–26.
Persi Diaconis, personal communication.
Persi Diaconis and David Freedman, Iterated random functions, SIAM Review, 41 (1999), 45–76.
Harry Furstenberg, Noncommuting random products, Trans. Amer. Math. Soc, 108 (1963), 377–428.
Robert Hough, personal communication.
Clark Kimberling, Encyclopedia of Triangle Centers, http://faculty.evansville.edu/ck6/encyclopedia/ETC.html
John Kingston and John Synge, The sequence of pedal triangles, Amer. Math. Monthly, 95 (1988), 609–620.
Peter Lax, The ergodic character of sequences of pedal triangles, Amer. Math. Monthly, 97 (1990), 377–381.
David Mannion, Convergence to collinearity of a sequence of random triangle shapes, Adv. Appl. Prob., 22 (1990), 831–844.
David Mannion, The invariant distribution of a sequence of random collinear triangle shapes, Adv. Appl. Prob., 22 (1990), 845–865.
Curt McMullen, personal communication.
Andrei A. Ordin, A generalized barycentric subdivision of a triangle, and semigroups of Möbius transformations, Russian Math. Surveys, 55 (2000), 591–592.
Maria-Cecilia Rivar and Gabriel Iribarren, The 4-triangles longest-side partition of triangles and linear refinement algorithms, Math, of Computation, 65 (1996), 1485–1502.
Ivo Rosenberg and Frank Stenger, A lower bound on the angles of triangles constructed by bisecting the longest side, Math, of Computation, 29 (1975), 390–395.
Richard Evan Schwartz, The density of shapes in three-dimensional barycentric subdivision, Discrete Comput Geom., 30 (2003), 373–377.
Richard Evan Schwartz, Affine subdivision, steerable semigroups, and sphere coverings, Pure and Applied Mathematics Quarterly, 3 (2007), 897–926.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Butler, S., Graham, R. (2010). Iterated Triangle Partitions. In: Katona, G.O.H., Schrijver, A., Szőnyi, T., Sági, G. (eds) Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13580-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13580-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13579-8
Online ISBN: 978-3-642-13580-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)