A faster circle-sweep Delaunay triangulation algorithm (Q427141)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster circle-sweep Delaunay triangulation algorithm |
scientific article; zbMATH DE number 6045927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster circle-sweep Delaunay triangulation algorithm |
scientific article; zbMATH DE number 6045927 |
Statements
A faster circle-sweep Delaunay triangulation algorithm (English)
0 references
13 June 2012
0 references
computational geometry
0 references
Delaunay triangulation
0 references
in-circle test
0 references
recursive edge-flipping
0 references
sweep-line
0 references
sweep-circle
0 references
0 references
0.8185994625091553
0 references
0.8185994625091553
0 references
0.8027768135070801
0 references
0.7790629863739014
0 references
0.7789913415908813
0 references
