Minimum-weight triangulation
id:
minimum-weight-triangulation-316-16642500
title:
Minimum-weight triangulation
text:
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 inpu
brand slug:
wiki
category slug:
encyclopedia
description:
Point set triangulation minimizing total length
original url:
https://en.wikipedia.org/wiki/Minimum-weight_triangulation
date created:
date modified:
2024-01-15T12:57:08Z
main entity:
{"identifier":"Q6865406","url":"https://www.wikidata.org/entity/Q6865406"}
image:
fields total:
13
integrity:
14