Greedy triangulation
id:
greedy-triangulation-284-7785165
title:
Greedy triangulation
text:
The Greedy Triangulation is a method to compute a polygon triangulation or a Point set triangulation using a greedy schema, which adds edges one by one to the solution in strict increasing order by length, with the condition that an edge cannot cut a previously inserted edge.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Greedy_triangulation
date created:
date modified:
2019-09-07T19:18:35Z
main entity:
{"identifier":"Q28811699","url":"https://www.wikidata.org/entity/Q28811699"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/28/Polygon_Greedy_triangulation_steps.svg","width":1407,"height":1367}
fields total:
13
integrity:
14