No label defined (Q4247445)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1302178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1302178 |
Statements
1998
0 references
0.8365148305892944
0 references
0.8321073651313782
0 references
0.8160478472709656
0 references
0.8089048266410828
0 references
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].
0 references
