\(L_{1}\) shortest path queries in simple polygons (Q2272388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127831844, #quickstatements; #temporary_batch_1723632976074
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891382868 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1809.07481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-point L1 shortest path queries in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / 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: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum length paths of a given homotopy class / 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: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127831844 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:10, 14 August 2024

scientific article
Language Label Description Also known as
English
\(L_{1}\) shortest path queries in simple polygons
scientific article

    Statements

    \(L_{1}\) shortest path queries in simple polygons (English)
    0 references
    0 references
    0 references
    10 September 2019
    0 references
    shortest paths
    0 references
    simple polygons
    0 references
    \(L_1\) metric
    0 references
    mountain decompositions
    0 references
    two-point queries
    0 references

    Identifiers