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

From MaRDI portal
Created claim: Wikidata QID (P12): Q114229287, #quickstatements; #temporary_batch_1717958398551
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-022-00424-6 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4294232669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the geodesic center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodesic Voronoi diagram of point sites in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: The furthest-site geodesic Voronoi diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding the convex hull of a set of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodesic farthest-site Voronoi diagram in a polygonal domain with holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodesic diameter of polygonal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the geodesic centers of a polygonal domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ray shooting in polygons using geodesic triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Searching with the Shortest-Path Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams for a moderate-sized point-set in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodesic farthest-point Voronoi diagram in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the geodesic center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing geodesic furthest neighbors in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4626291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-022-00424-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19: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
    0 references
    0 references
    0 references

    Identifiers

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