This article is cited in 1 paper

Geometry of convex polygons and locally minimal binary trees spanning these polygons

A. O. Ivanov, A. A. Tuzhilin

M. V. Lomonosov Moscow State University

Abstract: In previous works the authors have obtained an effective classification of planar locally minimal binary trees with convex boundaries. The main aim of the present paper is to find more subtle restrictions on the possible structure of such trees in terms of the geometry of the given boundary set. Special attention is given to the case of quasiregular boundaries (that is, boundaries that are sufficiently close to regular ones in a certain sense). In particular, a series of quasiregular boundaries that cannot be spanned by a locally minimal binary tree is constructed.

UDC: 514.77+512.816.4+517.924.8

MSC: 05C35

Received: 27.01.1998

DOI: 10.4213/sm378

 English version: Sbornik: Mathematics, 1999, 190:1, 71–110

Bibliographic databases:

• 
• 
• 
•