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.

UDC: 514.774

Received: 01.03.2002

DOI: 10.4213/mzm218

 English version: Mathematical Notes, 2003, 73:5, 625–635

Bibliographic databases:

• 
• 
• 
•