|
Convex Realizations of Planar Linear Trees
N. S. Gusev M. V. Lomonosov Moscow State University
Abstract:
We prove a necessary condition for the existence of a convex realization of a planar linear tree. In the case of broken lines, it is shown that this condition is sufficient; a continuous algorithm constructing such a realization is found.
Received: 01.03.2002
Citation:
N. S. Gusev, “Convex Realizations of Planar Linear Trees”, Mat. Zametki, 73:5 (2003), 665–675; Math. Notes, 73:5 (2003), 625–635
Linking options:
https://www.mathnet.ru/eng/mzm218https://doi.org/10.4213/mzm218 https://www.mathnet.ru/eng/mzm/v73/i5/p665
|
Statistics & downloads: |
Abstract page: | 398 | Full-text PDF : | 184 | References: | 42 | First page: | 2 |
|