A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968)
From MaRDI portal
(Redirected from Item:Q5405031)
 | 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 randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters |
scientific article; zbMATH DE number 6275999
- A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters |
scientific article; zbMATH DE number 6275999 |
|
Statements
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (English)
0 references
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters (English)
0 references
21 December 2016
0 references
31 March 2014
0 references
Voronoi diagram
0 references
Hausdorff distance
0 references
randomized incremental construction
0 references
point location
0 references
hierarchical data structure
0 references
0 references
0 references
0.9894614219665528
0 references
0.9402961730957032
0 references
0.9348200559616088
0 references
0.887400209903717
0 references
0.8652580380439758
0 references
