Shortest Path Queries in Polygonal Domains (Q3511429): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On geometric path query problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252291 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal shortest path queries in a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5490398 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Search in Planar Subdivisions / rank | |||
Normal rank |
Latest revision as of 13:19, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Shortest Path Queries in Polygonal Domains |
scientific article |
Statements
Shortest Path Queries in Polygonal Domains (English)
0 references
10 July 2008
0 references
0 references