Querying two boundary points for shortest paths in a polygonal domain (extended abstract)

DOI10.1007/978-3-642-10631-6_106MaRDI QIDQ3652291zbMATH OpenOpenAlexFDO

Authors Sang Won Bae, Yoshio Okamoto

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_106

Mathematics Subject Classification ID

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

Recommendations

• Querying two boundary points for shortest paths in a polygonal domain
• Two-point L₁ shortest path queries in the plane
• scientific article; zbMATH DE number 1305410
• Shortest Path Queries in Polygonal Domains
• Optimal shortest path queries in a simple polygon

Cited in

(4)

• Shortest Path Queries in Polygonal Domains
• Querying two boundary points for shortest paths in a polygonal domain
• A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
• Link distance and shortest path problems in the plane

This page was built for publication: Querying two boundary points for shortest paths in a polygonal domain (extended abstract)

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