A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||||||||||||||
(6 intermediate revisions by 5 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | scientific article; zbMATH DE number 6275999 | ||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/s00453-016-0118-y / rank | |||||||||||||||
Property / title | |||||||||||||||
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters (English) | |||||||||||||||
Property / title: A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1343.68259 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-642-54423-1_9 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/S00453-016-0118-Y / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: LATIN 2014: Theoretical Informatics / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
31 March 2014
| |||||||||||||||
Property / publication date: 31 March 2014 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6275999 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: Publication / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W1481203752 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2663004886 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1312.3904 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A combinatorial property of convex sets / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4796181 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Data structures for halfplane proximity queries and incremental Voronoi diagrams / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Voronoi Diagrams and Delaunay Triangulations / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Dynamic Point Location in General Subdivisions / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q5292190 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Farthest-polygon Voronoi diagrams / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Applications of random sampling in computational geometry. II / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The nature and meaning of perturbations in geometric computing / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: THE DELAUNAY HIERARCHY / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Computing the extreme distances between two convex polygons / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The upper envelope of piecewise linear functions: Algorithms and applications / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The upper envelope of Voronoi surfaces and its applications / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Algorithms - ESA 2003 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Concrete and abstract Voronoi diagrams / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Randomized incremental construction of abstract Voronoi diagrams / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A compact piecewise-linear Voronoi diagram for convex sites in the plane / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The Hausdorff Voronoi diagram of point clusters in the plane / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The L∞ Hausdorff Voronoi Diagram Revisited / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The Clarkson–Shor Technique Revisited and Extended / rank | |||||||||||||||
Normal rank |
Latest revision as of 01:54, 28 December 2024
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