Location of Repository

Geometrical minimum skeleton trees

By Bespamyatnykh Sergei Nikolayevich

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

Topics: 12A - Pure mathematics, MATHEMATICS,GEODESY. CARTOGRAPHY
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/35... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.