Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Minimum-weight_triangulation> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Minimum-weight_triangulation abstract "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.".
- Minimum-weight_triangulation wikiPageExternalLink minimum-weight-triangulator.
- Minimum-weight_triangulation wikiPageExternalLink 1975ClosestPoint.pdf.
- Minimum-weight_triangulation wikiPageExternalLink quasi.pdf.
- Minimum-weight_triangulation wikiPageExternalLink triang_2006.pdf.
- Minimum-weight_triangulation wikiPageExternalLink cccg1996_0012.pdf.
- Minimum-weight_triangulation wikiPageExternalLink cccg98-lingas-subexponential.ps.gz.
- Minimum-weight_triangulation wikiPageExternalLink Keil94.pdf.
- Minimum-weight_triangulation wikiPageExternalLink Epp-DCG-94.pdf.
- Minimum-weight_triangulation wikiPageID "22231180".
- Minimum-weight_triangulation wikiPageRevisionID "603439693".
- Minimum-weight_triangulation hasPhotoCollection Minimum-weight_triangulation.
- Minimum-weight_triangulation subject Category:NP-hard_problems.
- Minimum-weight_triangulation subject Category:Triangulation_(geometry).
- Minimum-weight_triangulation type Abstraction100002137.
- Minimum-weight_triangulation type Attribute100024264.
- Minimum-weight_triangulation type Condition113920835.
- Minimum-weight_triangulation type Difficulty114408086.
- Minimum-weight_triangulation type NP-hardProblems.
- Minimum-weight_triangulation type Problem114410605.
- Minimum-weight_triangulation type State100024720.
- Minimum-weight_triangulation comment "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.".
- Minimum-weight_triangulation label "Minimum-weight triangulation".
- Minimum-weight_triangulation sameAs m.05q4mqf.
- Minimum-weight_triangulation sameAs Q6865406.
- Minimum-weight_triangulation sameAs Q6865406.
- Minimum-weight_triangulation sameAs Minimum-weight_triangulation.
- Minimum-weight_triangulation wasDerivedFrom Minimum-weight_triangulation?oldid=603439693.
- Minimum-weight_triangulation isPrimaryTopicOf Minimum-weight_triangulation.