scientific article; zbMATH DE number 7788587

DOI10.4230/LIPICS.ISAAC.2021.14MaRDI QIDQ6187795zbMATH OpenFDO

Authors Sarita de Berg, Frank Staals

Publication date 15 January 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2021.14

zbMATH Keywords

data structuregeodesic distancenearest neighbor searchingsimple polygon

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Towards space efficient two-point shortest path queries in a polygonal domain
• Towards space efficient two-point shortest path queries in a polygonal domain

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 Q6187795)