A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems (Q4371752)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1106210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems |
scientific article; zbMATH DE number 1106210 |
Statements
A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems (English)
0 references
9 February 1998
0 references
Delaunay triangulations
0 references
oriented walk
0 references
0.8499206900596619
0 references
0.8404771685600281
0 references
0.8387604355812073
0 references
0.8336052298545837
0 references
0.8329293131828308
0 references
