Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design (Q5405905)
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 6278593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design |
scientific article; zbMATH DE number 6278593 |
Statements
Computing planar Voronoi diagrams in double precision (English)
0 references
3 April 2014
0 references
low-degree primitives
0 references
reduced precision
0 references
robust computation
0 references
Voronoi diagrams
0 references
0.8210306763648987
0 references
0.7890065908432007
0 references
0.7884639501571655
0 references
0.7865583896636963
0 references
0.7615042924880981
0 references
