An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809)

From MaRDI portal
Revision as of 15:28, 2 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references