scientific article; zbMATH DE number 1302178

From MaRDI portal
Publication:4247445





The newly-developed algorithmic paradigms for processing geometric shortest path queries and some related problems are discuss in dhe paper. Section 1 is for the planar settings that have poligonal obstacles. Section 2 presents a general paradigm, called the gateway paradigm. In section 3 it is applied to several problems of processing exact geometric shortest path queries. Section 4 applies this paradigm in approximate g.sh.p.q. Section 5 discusses some open problems. For the entire collection see [Zbl 0914.90001].











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