Computing a maxian point of a simple rectilinear polygon (Q2643818): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On rectilinear link distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear decompositions with low stabbing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a median point of a simple rectilinear polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / 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

Latest revision as of 14:19, 26 June 2024

scientific article
Language Label Description Also known as
English
Computing a maxian point of a simple rectilinear polygon
scientific article

    Statements