scientific article; zbMATH DE number 7788389

DOI10.5555/3458064.3458115MaRDI QIDQ6147301zbMATH OpenFDO

Authors

Publication date 15 January 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Towards space efficient two-point shortest path queries in a polygonal domain
• A new algorithm for Euclidean shortest paths in the plane
• Link diameter, radius and 2-point link distance queries in polygonal domains
• Towards space efficient two-point shortest path queries in a polygonal domain
• Realizing metric spaces with convex obstacles

This page was built for publication:

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