An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q114229287, #quickstatements; #temporary_batch_1717958398551 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114229287 / rank | |||
Normal rank | |||
Revision as of 20:47, 9 June 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
