A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726)
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 7175610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon |
scientific article; zbMATH DE number 7175610 |
Statements
A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (English)
0 references
28 February 2020
0 references
Voronoi diagrams
0 references
simple polygons
0 references
geodesic distance
0 references
computational geometry
0 references
0 references
0 references
0 references
0.9977254867553712
0 references
0.93866628408432
0 references
0.8938949108123779
0 references
0.8934565782546997
0 references
0.889253556728363
0 references
