On two centers of convex regions Definition: A line segment with both end points on the boundary of a planar convex region $C$ is called a chord of $C$.

*

*Consider any point $P$ within a given planar convex region $C$. From among all chords of $C$ that pass thru $P$, find that chord for which the ratio between the 2 segments into which $P$ divides the chord (longer seg : shorter seg) is a maximum and note this maximum. Now, how does one find and characterize the position of $P$ inside $C$ such that this maximum ratio is a minimum?

Remarks: Numerical experiments indicate that when $C$ is a triangle, the optimal position of $P$ is always the centroid of the triangle. But for general convex $C$, $P$ may not be at the center of mass.


*Consider any $P$ within a given planar convex region $C$. For every angle of orientation measured from $P$, there is a unique chord of $C$ that passes thru $P$. Consider the average over the orientation of the length of the corresponding chord. Now, how does one find and characterize that position of $P$ such that the average length of chord thru it is maximum?

Remarks:  Numerically, when $C$ is a triangle, the optimal position of $P$ does not seem to be on the centroid or incenter of $C$. Note also that the average length of chord thru $P$ can also be considered over each chord starting at each point on the boundary of $C$ and passing thru $P$ – in this case we might have a different optimal $P$.
Note 1: Both questions above appear to have natural higher dimensional analogs.
Note 2: (this is actually, a further question) We can also look for that interior point that minimizes the ratio between the max distance from it to the boundary of C and the min distance from it to the boundary of C. Numerically, when C is a triangle, this 'center' is not seen to coincide with centroid or incenter.
 A: This is not really an answer to the questions but 2 observations about the first definition. I only have proof sketches for both, but if I can always try to fill in more details.

*

*for any point P define its depth as the maximum of (longer seg : shorter seg). So the depth of a point in a convex region is some value between 1 and infinity, where the points of depth infinity are those on the boundary. We are looking for a point which has minimal depth. I claim that there is always a point of depth 2, which is tight, as witnessed by the centroid in an equilateral triangle.
Sketch of a proof: for any point P we define a vector as follows. If there is a chord through P on which the ratio is >2, we put in a vector along the chord towards the larger side (we call those the chord vectors). We then average over all such vectors. Intuitively, this vector „drags“ P into the direction of the solution. It can be shown that no 3 chord vectors can have P in their convex hull (using convexity and the fact that we only define a chord vector if the ratio is >2), implying that the average vector can only be 0 if the depth of P is at most 2. The existence of such a point now follows from the Brouwer fixed point theorem.


*let A(x) be the region of all points with depth at most x. Then these regions are nested (by definition) and convex, implying that the optimal point is unique.
To see that the regions are convex, consider points a and b of depth x and assume there is a point c on the segment ab of larger depth. This means there is a chord gh through c s.t. the ratio gc/ch>x. Consider now the chords defined by g and a, and g and b. On both these chords the ratio must be at most x. But from this it follows that the chord through the two other endpoints does not cross the chord gh, implying that c is not on the boundary of the convex hull, which is a contradiction.
