Jump to content

Talk:Bowyer–Watson algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 15:02, 5 February 2020 (Signing comment by 132.180.194.68 - "Incorrect Result?: new section"). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article 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.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Incorrect Result?

The Voronoi tessellation of the vertices in the example is not dual to the result shown. Correspondingly, the result shown is not a correct Delaunay triangulation: The circumcircle of the middle triangle (of the final three) contains the rightmost vertex. The correct triangulation would not connect the topmost with the bottom right vertex, but the bottom left with the rightmost. That would also be dual to the correct Voronoi tessellation. I think the problem lies with the incremental process. The Delaunay triangulation in the step before inserting the rightmost vertex is correct. Then, inserting that vertex, the correct triangle is split up, but in combination with its neighbouring triangles, we generate this wrong triangulation. Perhaps there is a check needed after the insert, and in case of violation, a flip of the edge within a combination of four vertices? As far as I can tell from a glance at the papers, this is also not addressed in there? — Preceding unsigned comment added by 132.180.194.68 (talk) 15:01, 5 February 2020 (UTC)[reply]