Piercing pairwise intersecting geodesic disks (Q2230402): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: GEODESIC-PRESERVING POLYGON SIMPLIFICATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing weakly simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3029701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274656 / 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: Stabbing pairwise intersecting disks by five points / 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: A subexponential bound for linear programming / 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: Computing the geodesic center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738164 / rank
 
Normal rank

Latest revision as of 15:14, 26 July 2024

scientific article
Language Label Description Also known as
English
Piercing pairwise intersecting geodesic disks
scientific article

    Statements

    Identifiers

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