Jump to content

Talk:Ruppert's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 188.163.168.110 (talk) at 10:29, 22 September 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Redirect‑class Low‑priority
WikiProject iconThis redirect is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
RedirectThis redirect does not require a rating on Wikipedia's content assessment scale.
LowThis redirect has been rated as Low-priority on the project's priority scale.

Thing that question's me after reading the article: What is the definition of a bad-quality Delaunay Triangle? --Hanknosemans (talk) 15:27, 16 July 2008 (UTC)[reply]

Bad triangles has at least one angle that is less then the poor threshold. Actually, you can use more conditions that suit your needs. Like the max area, the max largest side. It will still converge (using this conditions, you can surely make out conditions that won't ever converge).