Geometrical minimum skeleton trees

Abstract

The study deals with the geometrical minimum skeleton trees. Theorems allowing to construct effective algorithms are proved. Their computational complexity is studied. The lower estimates of complexity are received. Algorithms and programs of constructing minimum skeleton trees, trees of a minimum diameter, algorithms and programs of polygons modality computation are developedAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

Similar works

Full text

thumbnail-image

OpenGrey Repository

redirect
Last time updated on 14/06/2016

This paper was published in OpenGrey Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.