AI Chat AI Image Generator AI Video Text to Speech

Cut Locus Realizations on Convex Polyhedra

02/22/2021

∙

by Joseph O'Rourke, et al.

∙

∙

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 weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact a continuum of polyhedra P each realizing T for some x on P. Three main tools in the proof are properties of the star unfolding of P, Alexandrov's gluing theorem, and a cut-locus partition lemma. The construction of P from T is surprisingly simple.

Joseph O'Rourke
19 publications
Costin Vilcu
4 publications

research

∙ 12/07/2018

Cut polytope has vertices on a line

The cut polytope CUT(n) is the convex hull of the cut vectors in a comp...

0 Nevena Maric, et al. ∙

research

∙ 05/27/2022

A General approach to Ammann bars for aperiodic tilings

Ammann bars are formed by segments (decorations) on the tiles of a tilin...

0 Thomas Fernique, et al. ∙

research

∙ 12/12/2021

An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron

In the present paper, we propose a novel generalization of the celebrate...

0 Kazuma Tateiri, et al. ∙

research

∙ 07/09/2018

Cut-off Theorems for the PV-model

We prove cut-off results for deadlocks and serializability of a PV-threa...

0 Lisbeth Fajstrup, et al. ∙

research

∙ 02/22/2022

Topological Universality of the Art Gallery Problem

We prove that any compact semi-algebraic set is homeomorphic to the solu...

0 Jack Stade, et al. ∙

research

∙ 12/30/2022

Every Combinatorial Polyhedron Can Unfold with Overlap

Ghomi proved that every convex polyhedron could be stretched via an affi...

0 Joseph O'Rourke, et al. ∙

research

∙ 09/27/2021

Non-destructive methods for assessing tree fiber length distributions in standing trees

One of the main concerns of silviculture and forest management focuses o...

0 Sara Sjöstedt de Luna, et al. ∙