Two-Point L1 Shortest Path Queries in the Plane

DOI10.1145/2582112.2582125zbMath1395.68297arXiv1403.3458OpenAlexW2025376602MaRDI QIDQ4635565

Rajasekhar Inkulu, Danny Z. Chen, Haitao Wang

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.3458

zbMATH Keywords

shortest pathspolygonal domainspolygons with holes\(L_1\) metrictwo-point queriesweighted rectilinear obstacles

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time

This page was built for publication: Two-Point L1 Shortest Path Queries in the Plane