Abstract
We prove that every positively weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T edge weights matching C(x) edge lengths. If T has n leaves, P has (in general) n+1 vertices. We show there is in fact a continuum of polyhedra P each realizing T for some x∈P. Three main tools in the proof are properties of the star unfolding of P, Alexandrov's gluing theorem, and a new cut-locus partition lemma. The construction of P from T is surprisingly simple.
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.
