Bowyer–Watson algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 18:40, 22 December 2022 edit Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,588 edits →Pseudocode: fix formatting ← Previous edit		Latest revision as of 22:44, 25 November 2024 edit undo LR.127 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 25,443 edits Adding short description: "Computation method in geometry" Tag: Shortdesc helper
(One intermediate revision by one other user not shown)
Line 1: {{Short description\|Computation method in geometry}} In [[computational geometry]], the '''Bowyer–Watson algorithm''' is a method for computing the [[Delaunay triangulation]] of a finite set of points in any number of [[dimension]]s. The algorithm can be also used to obtain a [[Voronoi diagram]] of the points, which is the [[dual graph]] of the Delaunay triangulation. Line 51 ⟶ 52: == Further reading == {{Cite journal \| last1 = Bowyer \| first1 = Adrian \|author1-link=Adrian Bowyer\| title = Computing Dirichlet tessellations \| doi = 10.1093/comjnl/24.2.162 \| journal = [[The Computer Journal\|Comput. J.]] \| volume = 24 \| issue = 2 \| pages = 162–166 \| year = 1981 \| doi-access = free }} {{Cite journal \| last1 = Watson \| first1 = David F. \| title = Computing the ''n''-dimensional Delaunay tessellation with application to Voronoi polytopes \| doi = 10.1093/comjnl/24.2.167 \| journal = [[The Computer Journal\|Comput. J.]] \| volume = 24 \| issue = 2 \| pages = 167–172 \| year = 1981 \| doi-access = ~~free~~ }} * [http://paulbourke.net/papers/triangulate/ Efficient Triangulation Algorithm Suitable for Terrain Modelling] generic explanations with source code examples in several languages.