arXiv Analytics

Sign in

arXiv:1007.2301 [math.CO]AbstractReferencesReviewsResources

Subdivision by bisectors is dense in the space of all triangles

Steve Butler, Ron Graham

Published 2010-07-14Version 1

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show that starting with any arbitrary triangle, the resulting set of triangles formed by this process contains triangles arbitrarily close (up to similarity) any given triangle when the point that we use to subdivide is the incenter. We also show that the smallest angle in a "typical" triangle after repeated subdivision for many generations does not have the smallest angle going to zero.

Related articles: Most relevant | Search more
arXiv:1309.5336 [math.CO] (Published 2013-09-20)
Odd K_3,3 subdivisions in bipartite graphs
arXiv:2401.15403 [math.CO] (Published 2024-01-27)
Extremal density for subdivisions with length or sparsity constraints
arXiv:math/0509378 [math.CO] (Published 2005-09-16)
Subdivision of complexes of k-Trees