Fast and efficient restricted Delaunay triangulation in random geometric graphs (Q3400883)
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: Fast and efficient restricted Delaunay triangulation in random geometric graphs |
scientific article; zbMATH DE number 5663761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and efficient restricted Delaunay triangulation in random geometric graphs |
scientific article; zbMATH DE number 5663761 |
Statements
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs (English)
0 references
27 January 2010
0 references
long Delaunay edges
0 references
0.7738701105117798
0 references
0.7647116184234619
0 references
0.7645800709724426
0 references
0.7373846769332886
0 references
