Abstract
SummaryViviani's theorem states that the sum of distances from any point inside an equilateral triangle to its sides is constant. Here, in an extension of this result, we show, using linear programming, that any convex polygon can be divided into parallel line segments on which the sum of the distances to the sides of the polygon is constant.Let us say that a polygon has the CVS property if the sum of distances from any inner point to its sides is constant. An amazing converse of Viviani's theorem is deduced: if just three noncollinear points inside a convex polygon have equal sums of distances then the polygon has the CVS property. For concave polygons the situation is quite different. For polyhedra analogous results are deduced.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
