On Isosceles Triangles and Related Problems in a Convex Polygon

Details On Isosceles Triangles and Related Problems in a Convex Polygon On Isosceles Triangles and Related Problems in a Convex Polygon

2010-09-12

arxiv.org/abs/1009.2218v2

Computer Science

Computational Geometry

Scientific paper

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most $3n^2/4 + o(n^2)$ isosceles triangles and prove this conjecture for a special group of convex $n$-gons, (iii) prove that its vertices can form at most $\lfloor n/k \rfloor$ regular $k$-gons for any integer $k\ge 4$ and that this bound is optimal, and (iv) provide a short proof that the sum of all the distances between its vertices is at least $(n-1)/2$ and at most $\lfloor n/2 \rfloor \lceil n/2 \rceil(1/2)$ as long as the convex $n$-gon has unit perimeter.

Affiliated with

Also associated with

No associations

Rating

On Isosceles Triangles and Related Problems in a Convex Polygon does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Isosceles Triangles and Related Problems in a Convex Polygon, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Isosceles Triangles and Related Problems in a Convex Polygon will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326470