Shortest rectilinear path queries to rectangles in a rectangular domain

DOI10.1007/978-3-030-61792-9_22MaRDI QIDQ5918505zbMATH OpenOpenAlexFDO

Authors Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn

Publication date 13 October 2022

Published in LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-61792-9_22

zbMATH Keywords

farthest neighbornearest neighborrectangular domainshortest path query

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Shortest rectilinear path queries to rectangles in a rectangular domain
• Rectilinear short path queries among rectangular obstacles
• Rectilinear shortest paths in the presence of rectangular barriers
• Efficient approximate shortest-path queries among isothetic rectangular obstacles
• Parallel rectilinear shortest paths with rectangular obstacles

This page was built for publication: Shortest rectilinear path queries to rectangles in a rectangular domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918505)