книги Наука, техника, медицина Техника Транспорт Воздушный транспорт

Minimum-weight triangulation

Код 3424826

  • ISBN: 978-5-5088-7312-7

Нет в продаже

Аннотация к книге "Minimum-weight triangulation"

High Quality Content by WIKIPEDIA articles! In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles that meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perimeters of the triangles. The problem is NP-hard for point set inputs, but may be approximated to any desired degree of accuracy. For polygon inputs, it may be solved exactly in polynomial time. The minimum weight triangulation has also sometimes been called the optimal triangulation.

Оставить комментарий

Оцените книгу:

ISBN: 978-5-5088-7312-7

Книга находится в категориях

Справочники Словари-справочники

Вместе с этой книгой покупают