Two-point L1 shortest path queries in the plane
From MaRDI portal
Publication:2970460
DOI10.20382/jocg.v7i1a20zbMath1405.68098OpenAlexW2580070621MaRDI QIDQ2970460
Haitao Wang, Danny Z. Chen, Rajasekhar Inkulu
Publication date: 30 March 2017
Full work available at URL: https://doaj.org/article/966ccdffbad243ccabbfb469aef0b109
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (7)
Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Shadoks Approach to Low-Makespan Coordinated Motion Planning ⋮ \(L_{1}\) shortest path queries in simple polygons ⋮ Unnamed Item ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
This page was built for publication: Two-point L1 shortest path queries in the plane
