An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00454-022-00424-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-022-00424-6 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 30 December 2024
scientific article; zbMATH DE number 7729240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons |
scientific article; zbMATH DE number 7729240 |
Statements
An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (English)
0 references
17 August 2023
0 references
farthest sites
0 references
Voronoi diagrams
0 references
geodesic distance
0 references
shortest paths
0 references
simple polygons
0 references
0 references
0 references
0 references
